SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
From MaRDI portal
Recommendations
Cites work
- A belated proof of self-stabilization
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- A self-stabilizing algorithm for coloring planar graphs
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
- Fast parallel reordering and isomorphism testing of \(k\)-trees
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear time self-stabilizing colorings
- Self-stabilization
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- Self-stabilizing systems in spite of distributed control
Cited in
(7)- Linear time self-stabilizing colorings
- A self-stabilizing algorithm for coloring planar graphs
- An efficient self-stabilizing distance-2 coloring algorithm
- A self-stabilizing algorithm for the st-order problem
- Self-stabilizing labeling and ranking in ordered trees
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- An efficient self-stabilizing distance-2 coloring algorithm
This page was built for publication: SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675877)