Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
Klaus JansenMarek KarpinskiAndrzej LingasEike SeidelPublished in: STACS (2001)
Keyphrases
- approximation schemes
- approximation algorithms
- planar graphs
- undirected graph
- special case
- graph isomorphism
- graph theoretical
- worst case
- np hard
- geometric shapes
- graph mining
- graph theoretic
- bounded treewidth
- graph structure
- polynomial time complexity
- graph matching
- vertex set
- reeb graph
- spanning tree
- graph databases
- directed graph
- numerical methods
- topological information
- np complete
- graph cuts
- markov random field
- pairwise