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.

翻译：本文研究了在图中枚举（及计数）局部与全局极小防御联盟的任务。我们考虑了通用图及特殊图类。从输入敏感性的视角来看，所提出的算法在大多数情况下是最优的。