Algorithmic graph theory and perfect graphs /

Saved in:
Bibliographic Details
Author / Creator:Golumbic, Martin Charles.
Edition:2nd ed.
Imprint:Amsterdam ; Boston : Elsevier, 2004.
©2004
Description:1 online resource (xxvi, 314 pages) : illustrations
Language:English
Series:Annals of discrete mathematics ; 57
Annals of discrete mathematics ; 57.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/13592672
Hidden Bibliographic Details
ISBN:9780080526966
0080526969
0444515305
9780444515308
9780444515308
Notes:Includes bibliographical references and index.
Print version record.
Summary: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.
Other form:Print version: Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. 2nd ed. Amsterdam ; Boston : Elsevier, 2004 0444515305 9780444515308