SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS

DOI10.1142/S012905410500284XzbMath1098.68140OpenAlexW1975138301MaRDI QIDQ4675877

Wayne Goddard, David P. Jacobs, Stephen T. Hedetniemi, Pradip K. Srimani

Publication date: 6 May 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410500284x

zbMATH Keywords

\(k\)-forward numbering

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

A self-stabilizing algorithm to maximal 2-packing with improved complexity ⋮ An efficient self-stabilizing distance-2 coloring algorithm ⋮ An Efficient Self-stabilizing Distance-2 Coloring Algorithm

Cites Work

• Unnamed Item
• Linear time self-stabilizing colorings
• A belated proof of self-stabilization
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• A self-stabilizing algorithm for coloring planar graphs
• A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
• Self-stabilizing systems in spite of distributed control
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• Fast parallel reordering and isomorphism testing of \(k\)-trees

This page was built for publication: SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS