Minimum-cardinality global defensive alliances in general graphs
- 26 March 2025
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 349 (3) , 1891-1931
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Heuristics for k-domination models of facility location problems in street networksComputers & Operations Research, 2021
- Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problemApplied Soft Computing, 2021
- In search of dense subgraphs: How good is greedy peeling?Networks, 2021
- An improved binary programming formulation for the secure domination problemAnnals of Operations Research, 2020
- Alliances in graphs: Parameters, properties and applications—A surveyAKCE International Journal of Graphs and Combinatorics, 2018
- Some bounds on global alliances in treesDiscrete Applied Mathematics, 2013
- Alliance-based clustering scheme for group key management in mobile ad hoc networksThe Journal of Supercomputing, 2011
- On the global offensive alliance number of a graphDiscrete Applied Mathematics, 2009
- Global defensive -alliances in graphsDiscrete Applied Mathematics, 2009
- Grasp: An Annotated Bibliography2002