No Mr Postman. Visit the houses in this order!

 
I was browsing in Borders bookshop waiting for my wife when I came across this book. I got hooked after the first chapter,  bought it and have been reading it over the past couple of weeks. This book is a great introduction to graph theory and its applications, introducing theorems like the handshaking lemma and algorithms like the spanning tree algorithms of Djikstra and Prim and the Ford-Fulkerson min cut max flow theorem. It then goes on to show how they can be used to solve a number of practical problems. Proofs of the harder theorems are placed in a final chapter that can be read by the interested reader. It’s an easy read, but very interesting.
 
 
Advertisements
This entry was posted in Books. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s