Parameterized complexity of locally minimal defensive alliances

DOI10.1007/978-3-030-67899-9_11MaRDI QIDQ831707zbMATH OpenOpenAlexFDO

Authors Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

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)

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

Cites work

• scientific article; zbMATH DE number 5127204 (Why is no real title available?)
• scientific article; zbMATH DE number 2076807 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• A survey on alliances and related parameters in graphs
• Algorithmic meta-theorems for restrictions of treewidth
• Aspects of upper defensive alliances
• Graph Layout Problems Parameterized by Vertex Cover
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Small Alliances in Graphs
• The algorithmic complexity of alliances 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)