2 papers
cs.DM2018
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…
cs.DM2018
On Efficient Domination for Some Classes of -Free Bipartite Graphs
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…