Parameterized intractability of defensive alliance problem

DOI10.1007/978-3-030-95018-7_22MaRDI QIDQ6102284zbMATH OpenFDO

Authors Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

Publication date 8 May 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-95018-7_22

zbMATH Keywords

defensive allianceFPTparameterized complexitytreewidthW[1-hard]

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Alliances in graphs of bounded clique-width
• Defensive alliances in graphs of bounded treewidth
• Global alliances and independence in trees
• Global offensive alliances in graphs
• Graph minors. III. Planar tree-width
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2076807 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• On defensive alliances and line graphs
• On structural parameterizations of the bounded-degree vertex deletion problem
• On the complement graph and defensive \(k\)-alliances
• On the global offensive alliance number of a graph
• Parameterized algorithms
• Sparsity. Graphs, structures, and algorithms
• Treewidth. Computations and approximations

Cited in

(2)

• scientific article; zbMATH DE number 1873247 (Why is no real title available?)
• Defensive alliance polynomial

This page was built for publication: Parameterized intractability of defensive alliance problem

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