-Free Graphs in Polynomial Time.
Daniel LokshantovMartin VatshelleYngve VillangerPublished in: SODA (2014)
Keyphrases
- bounded treewidth
- polynomial time complexity
- graph isomorphism
- special case
- np complete
- graph matching
- planar graphs
- computational complexity
- approximation algorithms
- graph mining
- graph theoretic
- graph theory
- weighted graph
- graph clustering
- subgraph isomorphism
- series parallel
- graph structure
- graph representation
- graph data
- random graphs
- structured objects
- graphical models
- directed graph