Parallel ear decomposition search (EDS) and st-numbering in graphs
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 47, 277-298
- https://doi.org/10.1016/0304-3975(86)90153-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- On efficient parallel strong orientationInformation Processing Letters, 1985
- The VLSI Complexity of SortingIEEE Transactions on Computers, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983
- Parallel Algorithms in Graph Theory: Planarity TestingSIAM Journal on Computing, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Parallel Prefix ComputationJournal of the ACM, 1980
- Computing an st-numberingTheoretical Computer Science, 1976
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932