Parameterized complexity of locally minimal defensive alliances
From MaRDI portal
Publication:831707
DOI10.1007/978-3-030-67899-9_11OpenAlexW3127887006MaRDI QIDQ831707FDOQ831707
Ajinkya Gaikwad, Shuvam Kant Tripathi, Soumen Maity
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2105.10742
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
- Graph Layout Problems Parameterized by Vertex Cover
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Small Alliances in Graphs
- Aspects of upper defensive alliances
- A survey on alliances and related parameters in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
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)
