A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs.
Petr A. GolovachMatthew JohnsonDaniël PaulusmaJian SongPublished in: CoRR (2014)
Keyphrases
- computational complexity
- graph mining
- graph databases
- subgraph isomorphism
- connected subgraphs
- graph properties
- labeled graphs
- subgraph matching
- graph data
- maximum common subgraph
- reachability queries
- graph structures
- graph theoretic
- graph patterns
- graph matching
- dense subgraphs
- query graph
- subgraph mining
- high computational complexity
- topological information
- biological networks
- graph kernels
- frequent subgraphs
- np complete
- maximum clique
- special case
- directed graph
- graph partitioning
- np hard
- computational efficiency
- decision problems
- frequent subgraph mining
- graph structure
- bipartite graph
- graph theory
- pattern mining
- association graph
- community discovery
- weighted graph
- graph model