8 citations · 11 across the 4 of their papers we have counts for
10 papers · 1 filter
Finding Efficient Domination for -Free Bipartite Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
A vertex set in a finite undirected graph is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of if every vertex of is dominated by exactly one vertex o…
Finding Efficient Domination for -Free Bipartite Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
A vertex set in a finite undirected graph is an {\em efficient dominating set} (e.d.s.\ for short) of if every vertex of is dominated by exactly one vertex of .…
Independent sets in (,Triangle)-free graphs
Raffaele Mosca
The Maximum Weight Independent Set Problem (WIS) is a well-known NP-hard problem. A popular way to study WIS is to detect graph classes for which WIS can be solved in polynomial ti…
Finding Dominating Induced Matchings in -Free Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
Let be a finite undirected graph. An edge subset is a {\em dominating induced matching} ({\em d.i.m.}) in if every edge in is intersected by exac…
Finding Dominating Induced Matchings in -Free Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
Let be a finite undirected graph. An edge set is a {\em dominating induced matching} ({\em d.i.m.}) in if every edge in is intersected by exactly…
Maximum Weight Independent Sets for (,Triangle)-Free Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one…