Enumerating Minimal Defensive Alliances
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910461399662592 |
|---|---|
| author | Feng, Zhidan Fernau, Henning Mann, Kevin |
| author_facet | Feng, Zhidan Fernau, Henning Mann, Kevin |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_11963 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Enumerating Minimal Defensive Alliances Feng, Zhidan Fernau, Henning Mann, Kevin Computational Complexity Discrete Mathematics 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. |
| title | Enumerating Minimal Defensive Alliances |
| topic | Computational Complexity Discrete Mathematics |
| url | https://arxiv.org/abs/2312.11963 |