Algorithmic Graph Theory and Perfect Graphs, Volume 57 (Hardcover, 2nd edition)

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

General

Imprint:	North-Holland
Country of origin:	United States
Series:	Annals of Discrete Mathematics
Release date:	February 2004
First published:	February 2004
Authors:	Martin Charles Golumbic
Dimensions:	240 x 165 x 25mm (L x W x T)
Format:	Hardcover
Pages:	340
Edition:	2nd edition
ISBN-13:	978-0-444-51530-8
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Academic & Education > Professional & Technical > Mathematics
LSN:	0-444-51530-5
Barcode:	9780444515308

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!