A fast algorithm for powerful alliances in trees

DOI10.1007/978-3-642-17458-2_4MaRDI QIDQ3066142zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Linear time algorithms for weighted offensive and powerful alliances in trees
• scientific article; zbMATH DE number 5237261
• Alliances in graphs of bounded clique-width
• A lower bound on the global powerful alliance number in trees
• scientific article; zbMATH DE number 7478575

Cited in

(4)

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

This page was built for publication: A fast algorithm for powerful alliances in trees

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