AbstractWe provide two polynomial-time exact algorithms to compute a maximum stable set in graphs that are respectively (P6, triangle)-free, and (P6, C4)-free. The algorithm devised for (P6, C4)-free graphs is based on the search of simple augmenting trees and can be extended to heuristically solve the problem in a general graph
In this paper, we introduce two powerful graph reductions for the maximum weighted stable set (mwss)...
AbstractGiven an ordering of the vertices of a graph one can construct a maximal stable set of that ...
In this paper, we introduce two powerful graph reductions for the maximum weighted stable set (MWSS)...
The Maximum Stable Set (MS) problem is a well known NP-hard problem. However different graph classes...
This article deals with the Maximum Weight Stable Set (MWS) problem (and some other related NP-hard ...
The Maximum Weight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is well...
The Maximum Weight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is we...
Abstract: Given an ordering of the vertices of a graph one can construct a maximal stable set of tha...
AbstractThe maximum stable set problem is NP-hard, even when restricted to banner-free graphs. In th...
AbstractThe complexity status of the maximum stable set problem in the class of P5-free graphs is un...
AbstractThe complexity status of the stable set problem in the class of P5-free graphs is unknown. I...
AbstractWe prove that on (P7, banner)-free graphs the maximum weight stable set problem is solvable ...
AbstractWe give a O(nm) time algorithm for the maximum weight stable set (MWS) problem on P5- and co...
AbstractWe describe two classes of graphs for which the stability number can be computed in polynomi...
AbstractThe maximum stable set problem is NP-hard, even when restricted to banner-free graphs. In th...
In this paper, we introduce two powerful graph reductions for the maximum weighted stable set (mwss)...
AbstractGiven an ordering of the vertices of a graph one can construct a maximal stable set of that ...
In this paper, we introduce two powerful graph reductions for the maximum weighted stable set (MWSS)...
The Maximum Stable Set (MS) problem is a well known NP-hard problem. However different graph classes...
This article deals with the Maximum Weight Stable Set (MWS) problem (and some other related NP-hard ...
The Maximum Weight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is well...
The Maximum Weight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is we...
Abstract: Given an ordering of the vertices of a graph one can construct a maximal stable set of tha...
AbstractThe maximum stable set problem is NP-hard, even when restricted to banner-free graphs. In th...
AbstractThe complexity status of the maximum stable set problem in the class of P5-free graphs is un...
AbstractThe complexity status of the stable set problem in the class of P5-free graphs is unknown. I...
AbstractWe prove that on (P7, banner)-free graphs the maximum weight stable set problem is solvable ...
AbstractWe give a O(nm) time algorithm for the maximum weight stable set (MWS) problem on P5- and co...
AbstractWe describe two classes of graphs for which the stability number can be computed in polynomi...
AbstractThe maximum stable set problem is NP-hard, even when restricted to banner-free graphs. In th...
In this paper, we introduce two powerful graph reductions for the maximum weighted stable set (mwss)...
AbstractGiven an ordering of the vertices of a graph one can construct a maximal stable set of that ...
In this paper, we introduce two powerful graph reductions for the maximum weighted stable set (MWSS)...
DOI
Add to ORKG