
23 Jan
2009
23 Jan
'09
5:15 p.m.
I'm looking for a good book on graph algorithms, perhaps something a bit different than the usual introductory book. For example, I would like an algorithm for finding all paths from vertex v to vertex u, not necessarily the shortest one or the longest one. Also, algorithms for determining the girth, diameter, and other properties of graphs are of interest. Or perhaps I should be looking at journal papers? Any pointers will be appreciated. Roger House