The algorithmic complexity of alliances in graphs
From MaRDI portal
Recommendations
Cited in
(24)- Global defensive \(k\)-alliances in graphs
- Powerful alliances in graphs
- On a graph's security number
- Alliances in graphs: parameters, properties and applications -- a survey
- Alliances in graphs of bounded clique-width
- Defensive alliances in graphs
- Security in graphs
- On defensive alliances and strong global offensive alliances
- Globally minimal defensive alliances
- Stability of alliance number in graphs
- Alliances and Related Domination Parameters
- Algorithms and Complexity of Alliances in Graphs
- scientific article; zbMATH DE number 5127204 (Why is no real title available?)
- Alliances in directed graphs
- scientific article; zbMATH DE number 5237261 (Why is no real title available?)
- Structural parameterization of alliance problems
- Offensive alliances in graphs
- Globally minimal defensive alliances: a parameterized perspective
- Enumerating minimal defensive alliances
- On the tractability of defensive alliance problem
- Parameterized complexity of locally minimal defensive alliances
- Defensive alliances in signed networks
- Strong defensive alliances on graph operators
- Parameterized complexity of locally minimal defensive alliances
This page was built for publication: The algorithmic complexity of alliances in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635568)
