Algorithms and Complexity of Alliances in Graphs
- 15 September 2020
- book chapter
- Published by Springer Nature
- p. 521-536
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Defensive alliances in graphs of bounded treewidthDiscrete Applied Mathematics, 2018
- Global defensive sets in graphsDiscrete Mathematics, 2016
- Linear time algorithms for weighted offensive and powerful alliances in treesTheoretical Computer Science, 2015
- On defensive alliances and strong global offensive alliancesDiscrete Applied Mathematics, 2014
- SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETSParallel Processing Letters, 2013
- Global defensive alliances of trees and Cartesian product of paths and cyclesDiscrete Applied Mathematics, 2012
- Offensive -alliances in graphsDiscrete Applied Mathematics, 2009
- Cooperative mobile guards in gridsComputational Geometry, 2007
- Offensive alliances in graphsDiscussiones Mathematicae Graph Theory, 2004
- Theory of Graphs1962