Struction revisited

Authors:
Gabriela Alexe;Peter L. Hammer;Vadim V. Lozin;Dominique de Werra
Affiliations:
RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ;RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ;RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ;ROSE, IMA FSB, EPFL CH 1015 Lausanne, Switzerland
Venue:
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Year:
2003

Citing 13
Cited 2

Some uses of struction

Discrete Mathematics
Stability in circular arc graphs

Journal of Algorithms
The basic algorithm for pseudo-Boolean programming revisited

Selected papers on First international colloquium on pseudo-boolean optimization and related topics
On the stability number of AH-free graphs

Journal of Graph Theory
Stability number of bull- and chair-free graphs

Discrete Applied Mathematics
The struction algorithm for the maximum stable set problem revisited

Discrete Mathematics
Polynomially solvable cases for the maximum stable set problem

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs

Information Processing Letters
On the use of Boolean methods for the computation of the stability number

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
An Augmentation Algorithm for the Maximum Weighted Stable Set Problem

Computational Optimization and Applications
Conic reduction of graphs for the stable set problem

Discrete Mathematics
Vertex cover: further observations and further improvements

Journal of Algorithms
On the stable set problem in special P5-free graphs

Discrete Applied Mathematics

A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

Journal of Discrete Algorithms
Graph transformations preserving the stability number

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The struction method is a general approach to compute the stability number of a graph based on step-by-step transformations each of which reduces the stability number by exactly one. This approach has been originally derived from Boolean arguments and has been applied by different authors to compute in polynomial time the stability number in special classes of graphs. In the present paper we review basic results on this topic and propose a generalization of the struction. We also discuss its relationship with some other graph transformations, such as the cycle shrinking of Edmonds or the clique reduction of Lovász-Plummer, and the possibility to use stability preserving transformations to increase the efficiency of this approach.