Polynomial-time approximation schemes for geometric graphs.
Thomas ErlebachKlaus JansenEike SeidelPublished in: SODA (2001)
Keyphrases
- approximation schemes
- approximation algorithms
- undirected graph
- special case
- np hard
- graph theoretical
- worst case
- bounded treewidth
- graph isomorphism
- polynomial time complexity
- planar graphs
- graph matching
- numerical methods
- geometric structure
- graph mining
- graph theory
- graph theoretic
- topological information
- computer vision
- subgraph isomorphism
- np complete
- graph cuts
- dynamic programming
- lower bound
- computational complexity
- optimal solution