Algorithmic Graph Theory and Perfect Graphs

by Martin Charles Golumbic

Overview

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails.

The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.

• New edition of the "Classic" book on the topic
• Wonderful introduction to a rich research area
• Leading author in the field of algorithmic graph theory
• Beautifully written for the new mathematician or computer scientist
• Comprehensive treatment

Product Details

ISBN-13:	9780080526966
Publisher:	Elsevier Science
Publication date:	02/04/2004
Series:	ISSN , #57
Sold by:	Barnes & Noble
Format:	eBook
Pages:	340
File size:	12 MB
Note:	This product may take a few minutes to download.

What People are Saying About This

From the Publisher

Covers many applications associated with classes of perfect graphs

Editorial Reviews

"... this volume is, as was its predecessor, an excellent and motivating introduction to the world of perfect graphs" —D. de Werra (CH-LSNP; Lausanne) in: Mathematical Reviews

From the Publisher