Parameterized complexity of locally minimal defensive alliances
From MaRDI portal
(Redirected from Publication:831707)
Recommendations
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
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)