Polynomially solvable cases for the maximum stable set problem

Authors:
Alain Hertz
Affiliations:
-
Venue:
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Year:
1995

Bipartite graphs without a skew star

Discrete Mathematics
On the stable set problem in special P5-free graphs

Discrete Applied Mathematics
Pseudo-boolean optimization

Discrete Applied Mathematics
Struction revisited

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Augmenting graphs for independent sets

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Construction of a Maximum Stable Set with $k$-Extensions

Combinatorics, Probability and Computing
Augmenting chains in graphs without a skew star

Journal of Combinatorial Theory Series B
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

Journal of Discrete Algorithms
GreedyMAX-type algorithms for the maximum independent set problem

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science

Hi-index	0.00