Conic reduction of graphs for the stable set problem


The problem of finding a maximum stable (= independent) set of nodes in a graph has been tackled in various ways. One approach consists in using reduction methods, i.e., trying to associate to a given graphGwith (unknown) stability numberα(G) = max{|S|: S a stable set inG} a graphG1 with α(G1) = α(G)−pwhere p is a known positive integer (usually p= 1… (More)
DOI: 10.1016/S0012-365X(99)00408-2


Cite this paper

@article{Lozin2000ConicRO, title={Conic reduction of graphs for the stable set problem}, author={Vadim V. Lozin}, journal={Discrete Mathematics}, year={2000}, volume={222}, pages={199-211} }