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

4 papers · 1 filter

cs.DM2017★ 4 cited

Dominating Induced Matchings in $S_{1, 2, 4}$ -Free Graphs

Andreas Brandstädt, Raffaele Mosca

Let $G = (V, E)$ be a finite undirected graph without loops and multiple edges. A subset $M \subseteq E$ of edges is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every…

cs.DM2017★ 1 cited

Finding Dominating Induced Matchings in $(S_{2, 2, 3})$ -Free Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

Let $G = (V, E)$ be a finite undirected graph. An edge set $E^{'} \subseteq E$ is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly…

cs.DM2017

On Chordal- $k$ -Generalized Split Graphs

Andreas Brandstädt, Raffaele Mosca

A graph $G$ is a {\em chordal- $k$ -generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G [V ∖ Q]$ has at most…

cs.DM2017★ 3 cited

On Efficient Domination for Some Classes of $H$ -Free Chordal Graphs

Andreas Brandstädt, Raffaele Mosca

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

Dominating Induced Matchings in S1,2,4​-Free Graphs

Finding Dominating Induced Matchings in (S2,2,3​)-Free Graphs in Polynomial Time

On Chordal-k-Generalized Split Graphs

On Efficient Domination for Some Classes of H-Free Chordal Graphs

Dominating Induced Matchings in $S_{1, 2, 4}$ -Free Graphs

Finding Dominating Induced Matchings in $(S_{2, 2, 3})$ -Free Graphs in Polynomial Time

On Chordal- $k$ -Generalized Split Graphs

On Efficient Domination for Some Classes of $H$ -Free Chordal Graphs