Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs.

Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs.

Podrobná bibliografie
Vydáno v:Information processing letters. 61, 3 (1997).
Hlavní autor: Mosca, Raffaele
Médium: Článek
Jazyk:English
Témata:
Algorithms.
Combinatorial problems.
Computational complexity.
Stable set.