Algorithmic Graph Theory and Perfect Graphs

Algorithmic Graph Theory and Perfect Graphs

by Martin Charles Golumbic

340 pages· 2004· ISBN 9780080526966
Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
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 topic · Wonderful introduction to a rich research area · Leading author in the field of algorithmic graph theory · Beautifully written for the new mathematician or computer scientist · Comprehensive treatment

Discuss Algorithmic Graph Theory and Perfect Graphs with other readers

Join or start a book club for Algorithmic Graph Theory and Perfect Graphs on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Algorithmic Graph Theory and Perfect Graphs?

Sign up free on Readfeed, then browse public clubs or start your own club with Algorithmic Graph Theory and Perfect Graphs as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Algorithmic Graph Theory and Perfect Graphs with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Algorithmic Graph Theory and Perfect Graphs with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.