A self-stabilizing algorithm for optimally efficient sets in graphs

DOI10.1016/j.ipl.2012.02.014zbMath1248.05199OpenAlexW2075142792MaRDI QIDQ456061

K. E. Kennedy, Hao Jiang, Alice A. McRae, Sandra M. Hedetniemi, Stephen T. Hedetniemi

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.02.014

zbMATH Keywords

graph algorithmsself-stabilizing algorithmsoptimally efficient set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs ⋮ Self-stabilizing algorithms for efficient sets of graphs and trees ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ Self-Stabilizing Domination Algorithms

Cites Work

• Efficient sets in graphs
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Distance-k Information in Self-stabilizing Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A self-stabilizing algorithm for optimally efficient sets in graphs