The idea of enumeration algorithms with polynomial delay is to polynomia...
The analysis of (social) networks and multi-agent systems is a central t...
Roman domination is one of few examples where the related extension prob...
We study the algorithmic complexity of partitioning the vertex set of a ...
A graph G is well-covered if every minimal vertex cover of G is minimum,...
The concept of Roman domination has recently been studied concerning
enu...
The question to enumerate all inclusion-minimal connected dominating set...
Roman domination is one of the many variants of domination that keeps mo...