scientific article; zbMATH DE number 5237261

zbMath1145.05043MaRDI QIDQ5443191

Brian C. Dean, Lindsay H. Jamieson

Publication date: 20 February 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityalgorithmNP-hardweighted alliances

Mathematics Subject Classification ID

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

Related Items (6)

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

This page was built for publication: