Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	September 2001
Genre:	Schulbücher
	Applications / Berges / book / Combinatorics / computer science / Computer Science Special Topics / Discrete Mathematics / Diskrete Mathematik / Field / first / important area / Informatik / Kombinatorik / Mathematics / Mathematik / Methods / New / Questions / Research / Spezialthemen Informatik / Subject mehr...
ISBN:	9780471489702
EAN-Code:	9780471489702
Verlag:	Wiley
Einband:	Gebunden
Sprache:	English
Serie:	Wiley-Interscience Series in Discrete Mathematics and Optimization
Dimensionen:	H 253 mm / B 172 mm / D 28 mm
Gewicht:	822 gr
Seiten:	386
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Perfect graph theory was born out of a conjecture about graph colouring made by Claude Berge in 1960. That conjecture remains unsolved, but it has generated an important area of research in combinatorics. In this first book on the subject, the authors bring together all the questions, methods and ideas of perfect graph theory, and highlight the new methods and applications generated by Berge's conjecture. * Discusses the most recent developments in the field of perfect graph theory. * Highlights applications in frequency assignments for telecommunications systems, integer programming and optimization. * Discusses how semi-definite programming evolved out of perfect graph theory. * Includes an introduction by Claude Berg. * Features internationally respected authors. Primarily of interest to researchers from mathematics, combinatorics, computer science and telecommunications, the book will also appeal to students of graph theory.