Login / Signup
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete.
Martin Pergel
Published in:
WG (2007)
Keyphrases
</>
np complete
bounded treewidth
polynomial time complexity
object recognition
recognition rate
recognition accuracy
graph model
graph representation
graph matching
graph mining
neural network
d objects
convex hull
graph theoretic
graph construction
pspace complete