
24 Jan
2009
24 Jan
'09
12:30 a.m.
On Fri, Jan 23, 2009 at 12:09 PM, Zeljko Vrba <zvrba@ifi.uio.no> wrote:
On Fri, Jan 23, 2009 at 09:15:48AM -0800, Roger House wrote:
For example, I would like an algorithm for finding all paths from vertex v to vertex u, not necessarily the shortest
http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/
The Diestel book, and the _Algorithmic Graph Theory_ book that I recommended are both good texts, but may be more graph theoretical than you're looking for. But they're both worth a look. Here's a google books link for the AGT book that you can preview: http://books.google.com/books?id=5IV5elVucSwC&printsec=frontcover&dq=edition... Jon