Parallel approximation schemes for problems on planar graphs
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 145-156
- https://doi.org/10.1007/3-540-57273-2_51
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A parallel algorithm for approximating the minimum cycle coverAlgorithmica, 1993
- Planar Depth-First Search in $O(\log n)$ Parallel TimeSIAM Journal on Computing, 1990
- Parallel Algorithms for Shared-Memory MachinesPublished by Elsevier ,1990
- An efficient parallel algorithm for computing a large independent set in a plan graphPublished by Association for Computing Machinery (ACM) ,1989
- The parallel complexity of the subgraph connectivity problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Parallel approximation schemes for Subset Sum and Knapsack problemsActa Informatica, 1987
- An efficient parallel algorithm for planarityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Approximation algorithms for NP-complete problems on planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983