Parameterized complexity of locally minimal defensive alliances

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

Authors: Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi 

Publication date: 24 March 2022

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

Recommendations

• Globally minimal defensive alliances
• Defensive alliances in graphs
• Defensive alliances in graphs of bounded treewidth
• Aspects of upper defensive alliances
• Alliances in graphs of bounded clique-width

zbMATH Keywords

treewidthparameterized complexityFPT

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Algorithmic meta-theorems for restrictions of treewidth
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Layout Problems Parameterized by Vertex Cover
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Title not available (Why is that?)
• Small Alliances in Graphs
• Aspects of upper defensive alliances
• The algorithmic complexity of alliances in graphs
• A survey on alliances and related parameters in graphs

Cited In (2)

• Structural parameterization of alliance problems
• Globally minimal defensive alliances

This page was built for publication: Parameterized complexity of locally minimal defensive alliances

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