A. Brandstädt

activity

20112021

most citedPolynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs

31 citations · 109 across the 27 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.DM2014★ 31 cited

Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs

Andreas Brandstädt, Pavel Fičur, Arne Leitert +1

An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient…

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…

Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs

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

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