A new graph triconnectivity algorithm and its parallelization
- 1 March 1992
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 12 (1) , 53-76
- https://doi.org/10.1007/bf01191205
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Improved algorithms for graph four- connectivityJournal of Computer and System Sciences, 1991
- Parallel Merge SortSIAM Journal on Computing, 1988
- Efficient parallel triconnectivity in logarithmic timePublished by Springer Nature ,1988
- Parallel ear decomposition search (EDS) and st-numbering in graphsTheoretical Computer Science, 1986
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- Parallel tree contraction and its applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel Algorithms in Graph Theory: Planarity TestingSIAM Journal on Computing, 1982
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932