A link compilation of some Hackernews and Stackoverflow posts and a longish personal investigation.

- The DaMN book and its companion book
- Graph Theory with Applications, J.A. Bondy and U.S.R. Murty
- Graph Theory, Reinhard Diestel
- Graph Theory Tutorials
- Digraphs: Theory, Algorithms and Applications, 1st Edition
- Wikipedia – Graph Algorithms
- Algorithms and Complexity, Herbert S. Wilf
- Lecture notes Graphtheory by Tero Harju (Finland)
- Lecture notes Graphtheory by Keijo Ruohonen (Finland)
- Lessons at Math Cove
- Basics of Graphs

Google books

- Graph Theory with Application to Engineering and Computer Science, by Narsingh Deo
- A Course in Combinatorics

Chapters:

- Chapter 4.
*Algorithms, 4th Edition*by Robert Sedgewick and Kevin Wayne – a nice explanation with Java examples and exercises - Chapter 5. Graphs and graph algorithms
- Graph Search Algorithms in the Book “How to Think About Algorithms” from Jeff Edmonds
- Boost Docs – for C++ guys
- Chapter 7: Weighted Graphs

Visualizations

- Dijkstra & Co and some more Dijkstra
- A Star

None-free

- Introduction to Algorithms
- Graphentheorie by Clark and Holten
- Chapters from The Algorithm Design Manual, by Steven S. Skiena

Advertisements

Hello,

I read one of your previous posts about one-to-many matchings in bipartite graphs and its equivalence to max-clique problem. Did you find anything else about the problem? I am trying to solve and implement a solution to an identical problem in the area of constraint satisfaction algorithms. Any input on the problem will surely be helpful.

Inayat Shah

You mean the maximum matching in bipartite graphs?

http://en.wikipedia.org/wiki/Matching_(graph_theory)#Maximum_matchings_in_bipartite_graphs

What do you mean with “anything else”?

More generic solutions to nearly any of those problems can be obtained via cplex or one of http://stackoverflow.com/q/502102/194609