- We will send in 10–14 business days.
/images/books/3469149/9780444515308.jpg)
- Author: Martin Charles Golumbic
- Publisher: North-Holland
- ISBN-10: 0444515305
- ISBN-13: 9780444515308
- Format: 16.3 x 23.6 x 2.3 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Algorithmic Graph Theory and Perfect Graphs (e-book) (used book) | bookbook.eu
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.22:33:28
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Martin Charles Golumbic
- Publisher: North-Holland
- ISBN-10: 0444515305
- ISBN-13: 9780444515308
- Format: 16.3 x 23.6 x 2.3 cm, hardcover
- Language: English English
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.
Reviews