4 citations · 9 across the 18 of their papers we have counts for
5 papers · 1 filter
Offensive Alliances in Signed Graphs
Zhidan Feng, Henning Fernau, Kevin Mann +1
Signed graphs have been introduced to enrich graph structures expressing relationships between persons or general social entities, introducing edge signs to reflect the nature of t…
Enumerating Minimal Defensive Alliances
Zhidan Feng, Henning Fernau, Kevin Mann
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 class…
Perfect Roman Domination and Unique Response Roman Domination
Henning Fernau, Kevin Mann
The idea of enumeration algorithms with polynomial delay is to polynomially bound the running time between any two subsequent solutions output by the enumeration algorithm. While i…
Defensive Alliances in Signed Networks
Emmanuel Arrighi, Zhidan Feng, Henning Fernau +3
The analysis of (social) networks and multi-agent systems is a central theme in Artificial Intelligence. Some line of research deals with finding groups of agents that could work t…
Hitting the Romans
Henning Fernau, Kevin Mann
Roman domination is one of few examples where the related extension problem is polynomial-time solvable even if the original decision problem is NP-complete. This is interesting, a…