An efficient parallel algorithm for computing a large independent set in a plan graph
- 1 March 1989
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 379-387
- https://doi.org/10.1145/72935.72976
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Parallel Symmetry-Breaking in Sparse GraphsSIAM Journal on Discrete Mathematics, 1988
- A fast parallel coloring of planar graphs with five colorsInformation Processing Letters, 1987
- Software for Reading, Refereeing and Browsing in the BLEND SystemThe Computer Journal, 1985
- On linear-time algorithms for five-coloring planar graphsInformation Processing Letters, 1984
- An Approximation Algorithm for the Maximum Independent Set Problem on Planar GraphsSIAM Journal on Computing, 1982
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Every planar map is four colorableBulletin of the American Mathematical Society, 1976
- Efficient Planarity TestingJournal of the ACM, 1974