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

2 papers · 1 filter

cs.DM2019

Finding Dominating Induced Matchings in $P_{9}$ -Free Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

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

cs.DM2019★ 1 cited

Finding Dominating Induced Matchings in $S_{1, 1, 5}$ -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…

Finding Dominating Induced Matchings in P9​-Free Graphs in Polynomial Time

Finding Dominating Induced Matchings in S1,1,5​-Free Graphs in Polynomial Time

Finding Dominating Induced Matchings in $P_{9}$ -Free Graphs in Polynomial Time

Finding Dominating Induced Matchings in $S_{1, 1, 5}$ -Free Graphs in Polynomial Time