Parameterized complexity of locally minimal defensive alliances

DOI10.1007/978-3-030-67899-9_11OpenAlexW3127887006MaRDI QIDQ831707

Ajinkya Gaikwad, Shuvam Kant Tripathi, Soumen Maity

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2105.10742

zbMATH Keywords

treewidthparameterized complexityFPT

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Globally minimal defensive alliances ⋮ Structural parameterization of alliance problems

Cites Work

• Algorithmic meta-theorems for restrictions of treewidth
• Aspects of upper defensive alliances
• Integer Programming with a Fixed Number of Variables
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Small Alliances in Graphs
• Graph Layout Problems Parameterized by Vertex Cover
• Minkowski's Convex Body Theorem and Integer Programming
• A survey on alliances and related parameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item