A Fast Algorithm for Powerful Alliances in Trees

DOI10.1007/978-3-642-17458-2_4zbMath1311.05189OpenAlexW1586683235MaRDI QIDQ3066142

Ararat Harutyunyan

Publication date: 8 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_4

zbMATH Keywords

algorithmweighted treesalliancespowerful alliances

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs ⋮ \((F, I)\)-security in graphs ⋮ Alliances and Related Domination Parameters ⋮ Linear time algorithms for weighted offensive and powerful alliances in trees

This page was built for publication: A Fast Algorithm for Powerful Alliances in Trees