R. Mosca

activity

20112022

most citedDominating Induced Matchings for P7-Free Graphs in Linear Time

8 citations · 37 across the 21 of their papers we have counts for

collaborators

Showing 2015 · cs.DMShow all

3 papers · 2 filters

cs.DM2015★ 5 cited

Maximum Weight Independent Sets for ( $P_{7}$ ,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…

cs.DM2015★ 6 cited

Weighted Efficient Domination for $P_{6}$ -Free Graphs in Polynomial Time

Andreas Brandstadt, Raffaele Mosca

In a finite undirected graph $G = (V, E)$ , a vertex $v \in V$ {\em dominates} itself and its neighbors in $G$ . A vertex set $D \subseteq V$ is an {\em efficient dominating set} ({\em…

cs.DM2015★ 1 cited

Dominating Induced Matchings for $P_{8}$ -free Graphs in Polynomial Time

Andreas Brandstadt, Raffaele Mosca

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

Maximum Weight Independent Sets for (P7​,Triangle)-Free Graphs in Polynomial Time

Weighted Efficient Domination for P6​-Free Graphs in Polynomial Time

Dominating Induced Matchings for P8​-free Graphs in Polynomial Time

Maximum Weight Independent Sets for ( $P_{7}$ ,Triangle)-Free Graphs in Polynomial Time

Weighted Efficient Domination for $P_{6}$ -Free Graphs in Polynomial Time

Dominating Induced Matchings for $P_{8}$ -free Graphs in Polynomial Time