
Ebook Info
- Published: 2004
- Number of pages: 563 pages
- Format: PDF
- File Size: 7.70 MB
- Authors: Martin Charles Golumbic
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. New edition of the “Classic” book on the topicWonderful introduction to a rich research areaLeading author in the field of algorithmic graph theoryBeautifully written for the new mathematician or computer scientistComprehensive treatment
User’s Reviews
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐Great book. Learning a lot and constantly using it. Very useful and worth the money.
⭐
⭐
Keywords
Free Download Algorithmic Graph Theory and Perfect Graphs (ISSN Book 57) 2nd Edition in PDF format
Algorithmic Graph Theory and Perfect Graphs (ISSN Book 57) 2nd Edition PDF Free Download
Download Algorithmic Graph Theory and Perfect Graphs (ISSN Book 57) 2nd Edition 2004 PDF Free
Algorithmic Graph Theory and Perfect Graphs (ISSN Book 57) 2nd Edition 2004 PDF Free Download
Download Algorithmic Graph Theory and Perfect Graphs (ISSN Book 57) 2nd Edition PDF
Free Download Ebook Algorithmic Graph Theory and Perfect Graphs (ISSN Book 57) 2nd Edition