Linear time algorithms for weighted offensive and powerful alliances in trees

DOI10.1016/j.tcs.2015.03.017zbMath1310.68164OpenAlexW2089850423MaRDI QIDQ2342667

Sylvain Legay, Ararat Harutyunyan

Publication date: 29 April 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.017

zbMATH Keywords

algorithmtreesoffensive alliancepowerful allianceglobal weighted alliances

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Algorithms and Complexity of Alliances in Graphs

Cites Work

• Unfriendly partitions of a graph
• On the global offensive alliance number of a graph
• Powerful alliances in graphs
• Global defensive alliances in graphs
• Some bounds on global alliances in trees
• On defensive alliances and line graphs
• A Fast Algorithm for Powerful Alliances in Trees
• Offensive alliances in cubic graphs
• Global offensive alliances in graphs
• Spectral study of alliances in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear time algorithms for weighted offensive and powerful alliances in trees