Freshly Printed - allow 10 days lead
Couldn't load pickup availability
Algorithmic Graph Theory and Perfect Graphs
Covers many applications associated with classes of perfect graphs
Martin Charles Golumbic (Author)
9780444515308, Elsevier Science
Hardback, published 4 February 2004
340 pages
24 x 16.5 x 2.4 cm, 0.66 kg
"... 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
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.
Subject Areas: Mathematical theory of computation [UYA], Combinatorics & graph theory [PBV]
