A parallel algorithm for eliminating cycles in undirected graphs
- 28 May 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 34 (6) , 307-312
- https://doi.org/10.1016/0020-0190(90)90015-p
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972