Searching for "The Maximum Independent Set Problem in Planar Graphs." – sorted by Relevance.
-
A Planar Separator Theorem by RICHARD J.
- good approximate solution to NP-complete problems on planar graph. Maximum independent set problems
- Add To MetaCart
-
On Parallel Algorithms for Combinatorial Problems
- . We extend some well known approximation heuristics for the maximum independent set problem for planar
- Cited by 1 (0 self) – Add To MetaCart
-
Local tree-width, excluded minors, and approximation algorithms
- (PTAS) for the MAXIMUM INDEPENDENT SET problem on planar graphs [15] and, more generally, classes
- Cited by 36 (3 self) – Add To MetaCart

