Successive approximation in parallel graph algorithms
- 30 July 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 74 (1) , 19-35
- https://doi.org/10.1016/0304-3975(90)90004-2
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Improved algorithms for graph four-connectivityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Parallel ear decomposition search (EDS) and st-numbering in graphsTheoretical Computer Science, 1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932