V. Giakoumakis

most citedWeighted Efficient Domination for

(P_{5} + k P_{2})

-Free Graphs in Polynomial Time

14 citations · 14 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DM2014★ 14 cited

Weighted Efficient Domination for $(P_{5} + k P_{2})$ -Free Graphs in Polynomial Time

Andreas Brandstadt, Vassilis Giakoumakis

Let $G$ be a finite undirected graph. A vertex {\em dominates} itself and all its neighbors in $G$ . A vertex set $D$ is an {\em efficient dominating set} (\emph{e.d.}\ for short) o…

cs.DM2011

Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences

Andreas Brandstädt, Vassilis Giakoumakis

Clique separator decomposition introduced by Tarjan and Whitesides is one of the most important graph decompositions. A graph is an {\em atom} if it has no clique separator. A {\em…

Weighted Efficient Domination for (P5​+kP2​)-Free Graphs in Polynomial Time

Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences

Weighted Efficient Domination for $(P_{5} + k P_{2})$ -Free Graphs in Polynomial Time