A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
From MaRDI portal
Publication:845924
DOI10.1016/J.IPL.2006.09.004zbMath1185.68078OpenAlexW2074329201MaRDI QIDQ845924
Jehn-Ruey Jiang, Chi-Hung Tzeng, Shing-Tsaan Huang
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.004
Related Items (6)
Distributed edge coloration for bipartite networks ⋮ An efficient self-stabilizing distance-2 coloring algorithm ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks ⋮ A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks ⋮ An Efficient Self-stabilizing Distance-2 Coloring Algorithm
Cites Work
- Unnamed Item
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Self-stabilizing coloration in anonymous planar networks
- A self-stabilizing algorithm for coloring planar graphs
- Planar graphs of maximum degree seven are Class I
- Improved edge-coloring algorithms for planar graphs
- Coloring planar graphs in parallel
- Efficient parallel algorithms for edge coloring problems
- The NP-Completeness of Edge-Coloring
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Self-stabilizing systems in spite of distributed control
- Nearly optimal distributed edge coloring in O(log log n) rounds
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- An experimental study of a simple, distributed edge-coloring algorithm
- Every planar graph with maximum degree 7 is of class 1
This page was built for publication: A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
