Parallel O(log n) time edge-colouring of trees and Halin graphs
DOI10.1016/0020-0190(88)90080-4zbMATH Open0652.68084OpenAlexW2042837269MaRDI QIDQ1107328FDOQ1107328
Authors: A. Gibbons, Amos Israeli, Wojciech Rytter 
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/60801/12/WRAP_cs-rr-105.pdf
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- An Efficient Parallel Biconnectivity Algorithm
- Parallelism in random access machines
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
- On the chromatic index of outerplanar graphs
- Title not available (Why is that?)
- A fast parallel algorithm for routing in permutation networks
- Parallel Algorithms in Graph Theory: Planarity Testing
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Parallel algorithms for a class of graphs generated recursively
- NC-algorithms for graphs with small treewidth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimally edge-colouring outerplanar graphs is in NC
- Title not available (Why is that?)
- A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
This page was built for publication: Parallel O(log n) time edge-colouring of trees and Halin graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107328)
