31 citations · 109 across the 27 of their papers we have counts for
8 papers · 1 filter
Maximum Weight Independent Sets for (,Triangle)-Free Graphs in Polynomial Time
Andreas Brandstadt, 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…
Bounding the Clique-Width of -free Split Graphs
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang +1
A graph is -free if it has no induced subgraph isomorphic to . We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new…
Weighted Efficient Domination for -Free Graphs in Polynomial Time
Andreas Brandstadt, Raffaele Mosca
In a finite undirected graph , a vertex {\em dominates} itself and its neighbors in . A vertex set is an {\em efficient dominating set} ({\em…
Weighted Efficient Domination for -Free Graphs in Linear Time
Andreas Brandstadt
In a finite undirected graph , a vertex {\em dominates} itself and its neighbors. A vertex set in is an {\em efficient dominating set} ({\em…
Dominating Induced Matchings for -free Graphs in Polynomial Time
Andreas Brandstadt, Raffaele Mosca
Let be a finite undirected graph. An edge set is a dominating induced matching (d.i.m.) in if every edge in is intersected by exactly one edge of…
Weighted Efficient Domination in Classes of -free Graphs
Andreas Brandstadt, T. Karthick
In a graph , an efficient dominating set is a subset of vertices such that is an independent set and each vertex outside has exactly one neighbor in . The Minimum…