scientific article; zbMATH DE number 5237261

MaRDI QIDQ5443191zbMATH OpenFDO

Authors Lindsay H. Jamieson, Brian C. Dean

Publication date 20 February 2008

zbMATH Keywords

algorithmcomplexityNP-hardweighted alliances

Mathematics Subject Classification ID

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

Recommendations

• Small alliances in a weighted graph
• scientific article; zbMATH DE number 2104820
• Alliances in directed graphs
• Powerful alliances in graphs
• Strong alliances in graphs
• Algorithms and Complexity of Alliances in Graphs
• The algorithmic complexity of alliances in graphs
• Alliances in graphs of bounded clique-width
• Alliances in graphs: parameters, properties and applications -- a survey
• On weighted clique graphs

Cited in

(8)

• Alliances in graphs of bounded clique-width
• Linear time algorithms for weighted offensive and powerful alliances in trees
• A fast algorithm for powerful alliances in trees
• Algorithms and Complexity of Alliances in Graphs
• Alliances in generalized series parallel graphs
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• Small alliances in a weighted graph
• (F, I)-security in graphs

This page was built for publication:

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