A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.
Petr A. GolovachMatthew JohnsonDaniël PaulusmaJian SongPublished in: J. Graph Theory (2017)
Keyphrases
- computational complexity
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- subgraph matching
- labeled graphs
- graph structures
- connected subgraphs
- maximum common subgraph
- reachability queries
- subgraph mining
- graph data
- topological information
- frequent subgraph mining
- graph patterns
- maximum clique
- np complete
- directed graph
- graph theory
- graph matching
- high computational complexity
- graph structure
- query graph
- graph theoretic
- frequent subgraphs
- computational cost
- weighted graph
- dense subgraphs
- data structure
- maximal cliques
- graph kernels
- graph model
- graphical models
- computational efficiency
- memory requirements
- np hard
- special case