A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
From MaRDI portal
Publication:1195493
DOI10.1016/0020-0190(92)90117-EzbMath0769.68033MaRDI QIDQ1195493
Publication date: 29 November 1992
Published in: Information Processing Letters (Search for Journal in Brave)
edge-coloringparallel algorithmsparallelizationoptimal algorithmdesign and analysis of algorithmslinear algorithmtree contraction
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Linear algorithms for edge-coloring trees and unicyclic graphs
- Deterministic parallel list ranking
- Improved nonconservative sequential and parallel integer sorting
- Parallel O(log n) time edge-colouring of trees and Halin graphs
- Linear algorithms on recursive representations of trees
- Using euler partitions to edge color bipartite multigraphs
- A simple parallel tree contraction algorithm
This page was built for publication: A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
