- Tytuł:
- On Sequential Heuristic Methods for the Maximum Independent Set Problem
- Autorzy:
-
Lê, Ngoc C.
Brause, Christoph
Schiermeyer, Ingo - Powiązania:
- https://bibliotekanauki.pl/articles/31341835.pdf
- Data publikacji:
- 2017-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
maximum independent set
heuristic
MIN
MAX
VO
vertex ordering - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 2; 415-426
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł