-Free Graphs in Polynomial Time.
Chính T. HoàngMarcin KaminskiVadim V. LozinJoe SawadaXiao ShuPublished in: Algorithmica (2010)
Keyphrases
- graph isomorphism
- polynomial time complexity
- bounded treewidth
- special case
- graph model
- graph mining
- graph matching
- data sets
- planar graphs
- computational complexity
- neural network
- real time
- directed graph
- graph theoretic
- approximation algorithms
- graph theory
- weighted graph
- xml documents
- undirected graph
- graph partitioning
- random graphs
- subgraph isomorphism
- pattern recognition
- series parallel
- clustering algorithm