Algorithms and Complexity of Alliances in Graphs

DOI10.1007/978-3-030-58892-2_17OpenAlexW3158139647MaRDI QIDQ3384123

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

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

Related Items (1)

Approximation algorithm and hardness results for defensive domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global defensive sets in graphs
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• Global defensive alliances of trees and Cartesian product of paths and cycles
• Cooperative mobile guards in grids
• Offensive \(r\)-alliances in graphs
• Defensive alliances in graphs of bounded treewidth
• Linear time algorithms for weighted offensive and powerful alliances in trees
• On defensive alliances and strong global offensive alliances
• Offensive alliances in graphs
• SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS

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