Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph

DOI10.1007/978-3-319-06089-7_26MaRDI QIDQ5410656zbMATH OpenOpenAlexFDO

Authors Yihua Ding, James Z. Wang, Pradip K. Srimani

Publication date 16 April 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-06089-7_26

zbMATH Keywords

self-stabilizationsafe convergencesynchronous daemonminimal global offensive alliance

Mathematics Subject Classification ID

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

Recommendations

• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
• Distributed Computing - IWDC 2003
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• Global offensive alliances in graphs and random graphs

Cited in

(2)

• Self-Stabilizing Domination Algorithms
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs

This page was built for publication: Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph

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