Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.
Thomas ErlebachKlaus JansenEike SeidelPublished in: SIAM J. Comput. (2005)
Keyphrases
- approximation schemes
- approximation algorithms
- graph theoretical
- special case
- graph isomorphism
- np hard
- bounded treewidth
- graph theory
- worst case
- graph theoretic
- polynomial time complexity
- graph structure
- topological information
- planar graphs
- graph databases
- geometric structure
- computational complexity
- multiscale
- bounded degree
- numerical methods
- np complete
- graph mining
- high order
- object recognition