Algorithmic Graph Theory and Perfect Graphs

Martin Charles Golumbic

ISBN 10: 0444515305 / ISBN 13: 9780444515308

Verlag: Elsevier Science & Technology, North Holland, 2004

Beschreibung

nach der Bestellung gedruckt Neuware - Printed after ordering - 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.

Bestandsnummer des Verkäufers 9780444515308

Bibliografische Details

• Titel: Algorithmic Graph Theory and Perfect Graphs
• Verlag: Elsevier Science & Technology, North Holland
• Erscheinungsjahr: 2004
• Sprache: Englisch
• ISBN-10: 0444515305
• ISBN-13: 9780444515308
• Einband: Buch
• Auflage: 2. Auflage
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

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.

Críticas

"(...) 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 2005e: 05061.