Efficient parallel algorithms for path problems in planar directed graphs
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 447-457
- https://doi.org/10.1007/3-540-52921-7_94
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphsPublished by Association for Computing Machinery (ACM) ,1990
- Local reorientation, global order, and planar topologyPublished by Association for Computing Machinery (ACM) ,1989
- A parallel algorithm for finding a separator in planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- An efficient parallel algorithm for planarityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Parallel merge sortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- NP-CompletenessPublished by Springer Nature ,1984
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Shortest-path problem is not harder than matrix multiplicationInformation Processing Letters, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979