Algorithms and Complexity of Alliances in Graphs

DOI10.1007/978-3-030-58892-2_17MaRDI QIDQ3384123zbMATH OpenOpenAlexFDO

Authors Stephen T. Hedetniemi

Publication date 14 December 2021

Published in Developments in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-58892-2_17

Mathematics Subject Classification ID

General and overarching topics; collections (00-XX) Computer science (68-XX)

Cites work

• Cooperative mobile guards in grids
• Defensive alliances in circulant graphs.
• Defensive alliances in graphs of bounded treewidth
• Global defensive alliances of trees and Cartesian product of paths and cycles
• Global defensive sets in graphs
• Global powerful r-alliances and total k-domination in graphs
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 5127204 (Why is no real title available?)
• scientific article; zbMATH DE number 5237261 (Why is no real title available?)
• Linear time algorithms for weighted offensive and powerful alliances in trees
• Offensive \(r\)-alliances in graphs
• Offensive alliances in graphs
• On defensive alliances and strong global offensive alliances
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets
• The algorithmic complexity of alliances in graphs

Cited in

(4)

• Approximation algorithm and hardness results for defensive domination in graphs
• scientific article; zbMATH DE number 5127204 (Why is no real title available?)
• scientific article; zbMATH DE number 5237261 (Why is no real title available?)
• More on the complexity of defensive domination in graphs

This page was built for publication: Algorithms and Complexity of Alliances in Graphs

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