Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications.
Marco BressanMarc RothPublished in: CoRR (2021)
Keyphrases
- graph mining
- graph properties
- graph databases
- subgraph matching
- labeled graphs
- subgraph isomorphism
- graph theory
- connected subgraphs
- subgraph mining
- reachability queries
- graph data
- graph structures
- frequent subgraph mining
- query graph
- topological information
- frequent subgraphs
- computational complexity
- maximum clique
- maximum common subgraph
- worst case
- maximal cliques
- graph theoretic
- pattern mining
- dense subgraphs
- data structure
- pspace complete
- graph patterns
- np complete
- np hardness
- connected components