-free graphs in polynomial time.
Hajo BroersmaPetr A. GolovachDaniël PaulusmaJian SongPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- graph isomorphism
- special case
- bounded treewidth
- polynomial time complexity
- planar graphs
- graph mining
- computational complexity
- graph theoretic
- approximation algorithms
- graph representation
- worst case
- structured objects
- graph theory
- graph databases
- graph matching
- complex structures
- neural network
- lower bound
- graph search
- graph model
- subgraph isomorphism
- bounded degree
- graph clustering
- graph data
- spanning tree
- graph structure
- directed graph
- np complete
- upper bound
- pairwise
- genetic algorithm