A self-stabilizing algorithm for optimally efficient sets in graphs

DOI10.1016/J.IPL.2012.02.014MaRDI QIDQ456061zbMATH OpenOpenAlexFDO

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

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 algorithmsoptimally efficient setself-stabilizing algorithms

Mathematics Subject Classification ID

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

Recommendations

• Self-stabilizing algorithms for efficient sets of graphs and trees
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• scientific article; zbMATH DE number 2061538
• Efficient sets in graphs

Cites work

• Distance-\(k\) knowledge in self-stabilizing algorithms
• Distance-k Information in Self-stabilizing Algorithms
• Efficient sets in graphs
• scientific article; zbMATH DE number 3859049 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 933213 (Why is no real title available?)

Cited in

(8)

• 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
• A self-stabilizing algorithm for the st-order problem
• scientific article; zbMATH DE number 3987328 (Why is no real title available?)
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• Self-stabilizing metric graphs

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

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