A parallel algorithm for eliminating cycles in undirected graphs

DOI10.1016/0020-0190(90)90015-PzbMATH Open0695.68051MaRDI QIDQ910243FDOQ910243

Clifford Stein, Philip N. Klein

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmcyclesundirected graphsEuler tourCRCW PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Scaling algorithms for network problems
• Title not available (Why is that?)
• Matching is as easy as matrix inversion
• An O(logn) parallel connectivity algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
• Title not available (Why is that?)
• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• A parallel algorithm for approximating the minimum cycle cover
• An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
• Title not available (Why is that?)

   Recommendations

• Parallel algorithms for connectivity problems in graph theory 👍 👎
• A parallel algorithm for the maximal path problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Finding fundamental cycles and bridges on a tree-structured parallel computer 👍 👎
• Parallel algorithms for maximal acyclic sets 👍 👎

This page was built for publication: A parallel algorithm for eliminating cycles in undirected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910243)