Recognizing circle graphs in polynomial time.
Csaba P. GaborKenneth J. SupowitWen-Lian HsuPublished in: J. ACM (1989)
Keyphrases
- graph isomorphism
- planar graphs
- special case
- graph matching
- polynomial time complexity
- computational complexity
- bounded treewidth
- hough transform
- directed graph
- social networks
- cross section
- graph theoretic
- automatic recognition
- genetic algorithm
- graph partitioning
- random graphs
- subgraph isomorphism
- complex structures
- optimal solution
- bayesian networks