Parameterized intractability of defensive alliance problem

DOI10.1007/978-3-030-95018-7_22MaRDI QIDQ6102284

Shuvam Kant Tripathi, Soumen Maity, Ajinkya Gaikwad

Publication date: 8 May 2023

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

zbMATH Keywords

treewidthparameterized complexityFPTdefensive allianceW[1-hard]

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Graph minors. III. Planar tree-width
• On the global offensive alliance number of a graph
• On the complement graph and defensive \(k\)-alliances
• Treewidth. Computations and approximations
• Defensive alliances in graphs of bounded treewidth
• Alliances in graphs of bounded clique-width
• On structural parameterizations of the bounded-degree vertex deletion problem
• On defensive alliances and line graphs
• Global offensive alliances in graphs
• Global alliances and independence in trees
• Parameterized Algorithms

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