-Free Graphs in Polynomial Time.
Andreas BrandstädtElaine M. EschenErik FriesePublished in: CoRR (2015)
Keyphrases
- graph isomorphism
- bounded treewidth
- polynomial time complexity
- graph matching
- graph representation
- special case
- planar graphs
- graph structure
- computational complexity
- graph theoretic
- np complete
- directed graph
- graph clustering
- worst case
- labeled graphs
- complex structures
- graph model
- bipartite graph
- random graphs
- finite automata
- subgraph isomorphism
- small world
- approximation algorithms