Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Algorithmic Graph Theory and Perfect Graphs - Martin Charles Golumbic

Algorithmic Graph Theory and Perfect Graphs

Buch | Hardcover
340 Seiten
2004 | 2nd edition
North-Holland (Verlag)
978-0-444-51530-8 (ISBN)
CHF 108,20 inkl. MwSt
Conveys the message that intersection graph models are a necessary and important tool for solving real-world problems. This edition includes an Epilogue chapter, which covers topics such as the theory and applications of intersection graph models such as generalizations of permutation graphs and interval graphs.
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.
Erscheint lt. Verlag 4.2.2004
Reihe/Serie Annals of Discrete Mathematics
Sprache englisch
Maße 165 x 240 mm
Gewicht 660 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-444-51530-5 / 0444515305
ISBN-13 978-0-444-51530-8 / 9780444515308
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95