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 2020Show all

2 papers · 1 filter

cs.DM2020★ 2 cited

Finding Efficient Domination for $S_{1, 1, 5}$ -Free Bipartite Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (e.d.s.\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$ .…

cs.DM2020

Finding Efficient Domination for $S_{1, 3, 3}$ -Free Bipartite Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex o…

Finding Efficient Domination for S1,1,5​-Free Bipartite Graphs in Polynomial Time

Finding Efficient Domination for S1,3,3​-Free Bipartite Graphs in Polynomial Time

Finding Efficient Domination for $S_{1, 1, 5}$ -Free Bipartite Graphs in Polynomial Time

Finding Efficient Domination for $S_{1, 3, 3}$ -Free Bipartite Graphs in Polynomial Time