54 citations · 77 across the 6 of their papers we have counts for
Showing 2015 · cs.DMShow all
3 papers · 2 filters
cs.DM2015★ 1 cited
An algorithm for the weighted stable set problem in claw-free graphs with
Paolo Nobili, Antonio Sassano
In this paper we show how to solve the \emph{Maximum Weight Stable Set Problem} in a claw-free graph with in time . More precisely, in…
cs.DM2015
An algorithm for the weighted stable set problem in {claw, net}-free graphs with
Paolo Nobili, Antonio Sassano
In this paper we show that a connected {claw, net}-free graph with is the union of a strongly bisimplicial clique and at most two clique-strips. A clique…
cs.DM2015★ 4 cited
An algorithm for the weighted stable set problem in claw-free graphs
Paolo Nobili, Antonio Sassano
A graph is \emph{claw-free} if no vertex has three pairwise non-adjacent neighbours. The Maximum Weight Stable Set (MWSS) Problem in a claw-free graph is a natural genera…