Approximating the stability number and the chromatic number of a graph via semidefinite programming

Authors	N. Gvozdenovic
Supervisors	A. Schrijver
Cosupervisors	M. Laurent
Award date	10-04-2008
ISBN	9061965462 9789061965466
Number of pages	128
Organisations	Faculty of Science (FNWI) - Korteweg-de Vries Institute for Mathematics (KdVI)
Document type	PhD thesis
Note	Research conducted at: CWI
Language	English
Downloads	Thesis Cover Titlepage Preface Contents 1 Introduction 2 Notation and preliminaries 3 The Lov´asz theta number 4 Semidefinite programming upper bounds for the stability number 5 Semidefinite programming lower bounds for the chromatic number 6 Computational results 7 Perspectives Bibliography Index List of notation Samenvatting
Permalink to this page

Back

UvA-DARE