Offensive alliances in graphs

DOI10.1016/j.tcs.2024.114401arXiv2208.02992OpenAlexW4390956339MaRDI QIDQ6201327

Soumen Maity, Ajinkya Gaikwad

Publication date: 20 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

treewidthFPTParameterized complexityETHdefensive and offensive alliance\(\mathrm{W}[1\)-hard]

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global defensive alliances of trees and Cartesian product of paths and cycles
• Graph minors. III. Planar tree-width
• Offensive \(r\)-alliances in graphs
• On the complement graph and defensive \(k\)-alliances
• The complexity of domination problems in circle graphs
• Modular decomposition and transitive orientation
• Treewidth. Computations and approximations
• Algorithmic approach to the satisfactory graph partitioning problem
• Which problems have strongly exponential complexity?
• Defensive alliances in graphs of bounded treewidth
• On the kernelization complexity of string problems
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• Alliances in graphs of bounded clique-width
• Defensive alliances in graphs
• Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
• Integer Programming with a Fixed Number of Variables
• Capacitated Domination and Covering: A Parameterized Perspective
• Graph Layout Problems Parameterized by Vertex Cover
• Minkowski's Convex Body Theorem and Integer Programming
• Parameterized Algorithms
• Slightly Superexponential Parameterized Problems
• Exploring the gap between treedepth and vertex cover through vertex integrity

This page was built for publication: Offensive alliances in graphs