31 citations · 109 across the 27 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012★ 1 cited
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull
Andreas Brandstädt, Raffaele Mosca
The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most inves…
cs.DM2012
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient domin…