Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: vertex ordering

Sortuj według:

Ogranicz wyniki do:

On Sequential Heuristic Methods for the Maximum Independent Set Problem

100%

Lê N. C., Brause C., Schiermeyer I.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 2

415-426

We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3]. Induced forbidden subgraph sets, under which the algorithms give maximum independent sets, are described. The Caro-Wei bound [4,14] is verified and performance of the algorithms on some special graphs is considered.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Brause C.

1 Lê N. C.

1 Schiermeyer I.

1 2017

Wyniki wyszukiwania

On Sequential Heuristic Methods for the Maximum Independent Set Problem