Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
- 1 June 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (3) , 431-459
- https://doi.org/10.1137/0222032
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Deterministic parallel list rankingAlgorithmica, 1991
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Optimal parallel algorithms on planar graphsInformation and Computation, 1990
- A simple parallel tree contraction algorithmJournal of Algorithms, 1989
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic timeAlgorithmica, 1988
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- Optimal Tree Contraction in the EREW ModelPublished by Springer Nature ,1988
- An optimal parallel algorithm for dynamic expression evaluation and its applicationsPublished by Springer Nature ,1986
- Graph TheoryPublished by Springer Nature ,1979