Perfect Graphs (Wiley Series in Discrete Mathematics & Optimization) - Hardcover

 
9780471489702: Perfect Graphs (Wiley Series in Discrete Mathematics & Optimization)
Hardcover
ISBN 10: 0471489700 ISBN 13: 9780471489702
Verlag: Wiley, 2001

Inhaltsangabe

The theory of perfect graphs was born out of a conjecture about graph colouring made by Claude Berge in 1960. That conjecture remains unsolved, but has generated an important area of research in combinatorics. This book:
* Includes an introduction by Claude Berge, the founder of perfect graph theory

* Discusses the most recent developments in the field of perfect graph theory

* Provides a thorough historical overview of the subject

* Internationally respected authors highlight the new directions, seminal results and the links the field has with other subjects

* Discusses how semi-definite programming evolved out of perfect graph theory
The early developments of the theory are included to lay the groundwork for the later chapters. The most recent developments of perfect graph theory are discussed in detail, highlighting seminal results, new directions, and links to other areas of mathematics and their applications. These applications include frequency assignment for telecommunication systems, integer programming and optimisation.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

Jorge L. Ramírez-Alfonsín is the editor of Perfect Graphs, published by Wiley. Bruce Alan Reed FRSC is a Canadian mathematician and computer scientist, the Canada Research Chair in Graph Theory and a professor of computer science at McGill University. His research is primarily in graph theory.

Von der hinteren Coverseite

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.

Aus dem Klappentext

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Wiley
Erscheinungsdatum
2001
Sprache
Englisch
ISBN 10 
0471489700
ISBN 13 
9780471489702
Einband
Gebundene Ausgabe
Auflage
1
Anzahl der Seiten
386
Herausgeber
Ramírez-Alfonsín Jorge L., Reed Bruce A.
Kontakt zum Hersteller
Wiley-VCH GmbH
product_safety@wiley.com

Boschstrasse 12
Weinheim
69469
Deutschland