Enumerating Defensive Alliances
arXiv:2312.11963v1 [cs.CC] 19 Dec 2023 Page 1 arXiv:2312.11963v1 [cs.CC] 19 Dec 2023
Enumerating Defensive Alliances Zhidan Feng1,2, Henning Fernau2[0000−0002−4444−3220] …
Enumerating Defensive Alliances Zhidan Feng1,2, Henning Fernau2[0000−0002−4444−3220] …
Globally minimal defensive alliances
A defensive alliance in an undirected graph G=(V, E) is a nonempty set of vertices S
satisfying the condition that every vertex v∈ S has at least as many neighbours (including …
satisfying the condition that every vertex v∈ S has at least as many neighbours (including …
Parameterized Algorithms for Locally Minimal Defensive Alliance
A set $ D $ of vertices of a graph is a\emph {defensive alliance} if, for each element of $ D $,
the majority of its neighbours are in $ D $. We consider the notion of local minimality in this …
the majority of its neighbours are in $ D $. We consider the notion of local minimality in this …
Parameterized Complexity Of Defensive Alliances
B Horn - 2023 - studenttheses.uu.nl
A Defensive Alliance in a graph is a subset of the vertices where each vertex in the alliance
has more neighbours in the alliance, than outside it. They were originally introduced to …
has more neighbours in the alliance, than outside it. They were originally introduced to …
Alliances in Graphs: A Parameterized Perspective
SK Tripathi - 2022 - dr.iiserpune.ac.in
Throughout history, humans have formed communities, guilds, faiths etc in the hope of
coming together with a group of people having similar requirements, visions and goals …
coming together with a group of people having similar requirements, visions and goals …