2023/12/19 by Zhidan Feng, Henning Fernau, Feng, Zhidan +3
Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2312.11963
openalex publication_date 2023/12/19 · openalex created_date 2023/12/22 · openalex updated_date 2026/07/28
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.