The algorithmic complexity of alliances in graphs

zbMATH Open1176.05056MaRDI QIDQ3635568FDOQ3635568

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

Publication date: 6 July 2009

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

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)

Cited In (18)

• On defensive alliances and strong global offensive alliances
• Security in graphs
• Parameterized complexity of locally minimal defensive alliances
• Structural parameterization of alliance problems
• Title not available (Why is that?)
• Powerful alliances in graphs
• Stability of alliance number in graphs
• Offensive alliances in graphs
• Global defensive \(k\)-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
• Title not available (Why is that?)

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)