An efficient self-stabilizing distance-2 coloring algorithm
From MaRDI portal
(Redirected from Publication:3408175)
An efficient self-stabilizing distance-2 coloring algorithm (scientific article; zbMATH DE number 5674866)
An efficient self-stabilizing distance-2 coloring algorithm (scientific article; zbMATH DE number 5674866)
Recommendations
Cites work
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
- A self-stabilizing algorithm for coloring bipartite graphs
- A self-stabilizing algorithm for coloring planar graphs
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
- A self-stabilizing distributed algorithm for edge-coloring general graphs
- scientific article; zbMATH DE number 1863300 (Why is no real title available?)
- Linear time self-stabilizing colorings
- Models and solution techniques for frequency assignment problems
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
- Self-stabilizing coloration in anonymous planar networks
Cited in
(10)- Linear time self-stabilizing colorings
- A self-stabilizing algorithm for coloring bipartite graphs
- Distance-k Information in Self-stabilizing Algorithms
- Efficient transformation of distance-2 self-stabilizing algorithms
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- An efficient self-stabilizing distance-2 coloring algorithm
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
- scientific article; zbMATH DE number 2114409 (Why is no real title available?)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
- Distance-\(k\) knowledge in self-stabilizing algorithms
This page was built for publication: An efficient self-stabilizing distance-2 coloring algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408175)