Keyphrases
#BIS
33%
#ETH
33%
#P-hardness
44%
Bipartite Graph
16%
CI-graph
33%
Complexity Dichotomy
66%
Counting Complexity
83%
Counting Independent Sets
16%
Counting Problems
19%
Dyers
11%
Exponential Time
66%
Exponential Time Hypothesis
22%
Fixed Parameter
33%
Fixed Pattern
13%
Graph Anomaly Detection
16%
Graph Classes
40%
Graph Homomorphism
33%
Graph Matching
33%
Graph Parameters
24%
Graph Pattern
16%
Homomorphism
52%
Homomorphism numbers
11%
Immanants
33%
Induced Subgraph
13%
Injective Homomorphisms
33%
Intermediate Complexity
16%
K-matching
41%
K-path
16%
Karl Marx
16%
Line Graph
16%
Linear Combination
44%
Modular Counting
33%
NP-hard
25%
Number of Subgraphs
16%
Number of Vertices
16%
Odd number
16%
Parameterized Complexity
23%
Pattern Graph
30%
PI-line
16%
Polynomial Time
91%
Splittable
33%
Streaming Algorithms
33%
Streaming Model
22%
Subgraph Counting
23%
Sweeping
11%
Tight
33%
Tight Lower Bound
44%
Time Algorithm
16%
Time Complexity
33%
Vertex Cover number
16%
Mathematics
Analogous Result
8%
Approximates
25%
Bipartite Graph
11%
Computable Function
33%
Concludes
8%
Counting Problem
25%
Edge
56%
Exponential Time
66%
Homomorphism
100%
Independent Set
40%
Induced Subgraph
13%
Integer
54%
Irreducible Character
8%
Kernelization
33%
Key Difference
33%
Linear Combination
33%
Matrix (Mathematics)
8%
Maximum Degree
6%
Open Question
6%
Polynomial
50%
Polynomial Time
76%
Running Time
16%
Young Diagram
8%
