The algorithmic complexity of alliances in graphs

MaRDI QIDQ3635568zbMATH OpenFDO

Authors Lindsay H. Jamieson, Stephen T. Hedetniemi, Alice A. McRae

Publication date 6 July 2009

zbMATH Keywords

algorithmscomplexityalliancesdefensive allianceglobal alliancesalgorithms: complexity analysis

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2104820
• scientific article; zbMATH DE number 2076807
• Aspects of upper defensive alliances
• scientific article; zbMATH DE number 6843424
• Powerful alliances in graphs

Cited in

(18)

• scientific article; zbMATH DE number 5237261 (Why is no real title available?)
• On defensive alliances and strong global offensive alliances
• Security in graphs
• Parameterized complexity of locally minimal defensive alliances
• Powerful alliances in graphs
• scientific article; zbMATH DE number 5127204 (Why is no real title available?)
• Structural parameterization of alliance problems
• Stability of alliance number in graphs
• Global defensive \(k\)-alliances in graphs
• Offensive alliances in graphs
• Alliances in graphs of bounded clique-width
• Defensive alliances in graphs
• Globally minimal defensive alliances
• Alliances in directed graphs
• Algorithms and Complexity of Alliances in Graphs
• On a graph's security number
• Alliances and Related Domination Parameters
• Alliances in graphs: parameters, properties and applications -- a survey

This page was built for publication: The algorithmic complexity of alliances in graphs

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