Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths

Keyphrases

• Polynomial Time 100%
• Graph Matching 100%
• K-matching 100%
• Splittable 100%
• Modular Counting 100%
• Counting Complexity 50%
• Graph Pattern 50%
• Odd number 50%
• Karl Marx 50%
• Subgraph Counting 50%
• Time Algorithm 50%
• K-path 50%
• Graph Anomaly Detection 50%
• Number of Subgraphs 50%

Computer Science

• Subgraphs 100%
• Polynomial Time 50%

Mathematics

• Polynomial Time 40%
• Integer 40%
• Open Question 20%