Distance-k Information in Self-stabilizing Algorithms

DOI10.1007/11780823_27MaRDI QIDQ3613663zbMATH OpenOpenAlexFDO

Authors Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs, Vilmar Trevisan

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_27

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Recommendations

• Distance-\(k\) knowledge in self-stabilizing algorithms
• An efficient self-stabilizing distance-2 coloring algorithm
• Efficient transformation of distance-2 self-stabilizing algorithms
• scientific article; zbMATH DE number 2114409
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets

Cited in

(6)

• Self-Stabilizing Domination Algorithms
• An efficient self-stabilizing distance-2 coloring algorithm
• Efficient transformation of distance-2 self-stabilizing algorithms
• A self-stabilizing algorithm for optimally efficient sets in graphs
• Self-stabilizing metric graphs
• Distance-\(k\) knowledge in self-stabilizing algorithms

This page was built for publication: Distance-k Information in Self-stabilizing Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613663)