R. Mosca

activity

20112022

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

8 citations · 11 across the 4 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DM2020

Finding Efficient Domination for $S_{1, 1, 5}$ -Free Bipartite Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (e.d.s.\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$ .…

cs.DM2020

Independent sets in ( $P_{4} + P_{4}$ ,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 Efficient Domination for S1,1,5​-Free Bipartite Graphs in Polynomial Time

Independent sets in (P4​+P4​,Triangle)-free graphs

Finding Efficient Domination for $S_{1, 1, 5}$ -Free Bipartite Graphs in Polynomial Time

Independent sets in ( $P_{4} + P_{4}$ ,Triangle)-free graphs