Parameterized complexity of locally minimal defensive alliances
type: Item
instance of: scholarly article
title: Parameterized complexity of locally minimal defensive alliances
DOI: 10.1007/978-3-030-67899-9_11
author: Ajinkya Gaikwad
author: Soumen Maity
author: Shuvam Kant Tripathi
publication date: 2022-03-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/2105.10742
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7497527
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT
zbMATH Keywords: treewidth
MaRDI profile type: Publication
OpenAlex ID: W3127887006
cites work: Aspects of upper defensive alliances
cites work: Q3423990
cites work: Small Alliances in Graphs
cites work: Graph Layout Problems Parameterized by Vertex Cover
cites work: A survey on alliances and related parameters in graphs
cites work: Q4470237
cites work: Q3635568
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: Q4820818
cites work: Algorithmic meta-theorems for restrictions of treewidth
cites work: Integer Programming with a Fixed Number of Variables
cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
description: scientific article; zbMATH DE number 7497527