Enumerating Minimal Defensive Alliances
Zhidan Feng, Henning Fernau, Kevin J. Mann · arXiv (Cornell University) · 2023
In this paper, we study the task of enumerating (and counting) locally and globally minimal defensive alliances in graphs. We consider general graphs as well as special graph classes. From an input-sensitive perspective, our presented algorithms are mostly optimal.