A parallel algorithm for approximating the minimum cycle cover
From MaRDI portal
Publication:1207326
DOI10.1007/BF01185336zbMath0766.68048MaRDI QIDQ1207326
Clifford Stein, Philip N. Klein
Publication date: 1 April 1993
Published in: Algorithmica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel algorithm for eliminating cycles in undirected graphs
- Nowhere-zero 6-flows
- A good algorithm for edge-disjoint branching
- Edge-disjoint branching in directed multigraphs
- Covering Multigraphs by Simple Circuits
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- A fast parallel algorithm for routing in permutation networks
- Covering Graphs by Simple Circuits
- Using euler partitions to edge color bipartite multigraphs