Recognizing Circle Graphs in Polynomial Time
Csaba P. GaborWen-Lian HsuKenneth J. SupowitPublished in: FOCS (1985)
Keyphrases
- bounded treewidth
- graph isomorphism
- graph theory
- special case
- graph theoretic
- computational complexity
- worst case
- data sets
- planar graphs
- approximation algorithms
- weighted graph
- np hardness
- directed graph
- graph mining
- polynomial time complexity
- approximation ratio
- graph construction
- graph clustering
- automatic recognition
- graph partitioning
- shortest path
- graphical models
- search algorithm