Algorithms for the Maximum Independent Set Problem
This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induc...
Main Author: | |
---|---|
Other Authors: | |
Format: | Doctoral Thesis |
Language: | English |
Published: |
Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola"
2015
|
Subjects: | |
Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-172639 http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-172639 http://www.qucosa.de/fileadmin/data/qucosa/documents/17263/le_1b.pdf |