The Network Solver (Experimental)

Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993), Network Flows: Theory, Algorithms, and Applications, Englewood Cliffs, NJ: Prentice-Hall.

Applegate, D. L., Bixby, R. E., Chvátal, V., and Cook, W. J. (2006), The Traveling Salesman Problem: A Computational Study, Princeton Series in Applied Mathematics, Princeton, NJ: Princeton University Press.

Bron, C. and Kerbosch, J. (1973), “Algorithm 457: Finding All Cliques of an Undirected Graph,” Communications of the ACM, 16, 48–50.

Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990), Introduction to Algorithms, Cambridge, MA, and New York: MIT Press and McGraw-Hill.

Google (2011), “Google Maps,” http://maps.google.com, accessed March 16, 2011.

Harley, E. R. (2003), Graph Algorithms for Assembling Integrated Genome Maps, Ph.D. diss., University of Toronto.

Johnson, D. B. (1975), “Finding All the Elementary Circuits of a Directed Graph,” SIAM Journal on Computing, 4, 77–84.

Jonker, R. and Volgenant, A. (1987), “A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems,” Computing, 38, 325–340.

Krebs, V. (2002), “Uncloaking Terrorist Networks,” First Monday, 7, available at http://www.firstmonday.org/issues/issue7_4/krebs/.

Kruskal, J. B. (1956), “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proceedings of the American Mathematical Society, 7, 48–50.

Stoer, M. and Wagner, F. (1997), “A Simple Min-Cut Algorithm,” Journal of the Association for Computing Machinery, 44, 585–591.

Tarjan, R. E. (1972), “Depth-First Search and Linear Graph Algorithms,” SIAM Journal on Computing, 1, 146–160.

Willingham, V. (2009), “Massive Transplant Effort Pairs 13 Kidneys to 13 Patients,” CNN Health, http://www.cnn.com/2009/HEALTH/12/14/kidney.transplant/index.html, accessed March 16, 2011.