The OPTGRAPH Procedure

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, NJ: Princeton University Press.

Batagelj, V., and Zaversnik, M. (2003). “An O(m) Algorithm for Cores Decomposition of Networks.” Computing Research Repository cs.DS/0310049.

Blondel, V. D., Guillaume, J. L., Lambiotte, R., and Lefebvre, E. (2008). “Fast Unfolding of Communities in Large Networks.” Journal of Statistical Mechanics: Theory and Experiment 10:10000–10014.

Boitmanis, K., Freivalds, K., Ledins, P., and Opmanis, R. (2006). “Fast and Simple Approximation of the Diameter and Radius of a Graph.” In Experimental Algorithms, vol. 4007, edited by C. Alvarez, and M. Serna, 98–108. Berlin: Springer-Verlag. 10.1007/11764298_9.

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.

Fowler, J. H., and Joen, S. (2008). “The Authority of Supreme Court Precedent.” Social Networks 30:16–30. http://jhfowler.ucsd.edu/judicial.htm.

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

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.

Kleinberg, J. (1998). “Authoritative Sources in a Hyperlinked Environment.” In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 668–677. Philadelphia: Society for Industrial and Applied Mathematics.

Krackhardt, D. (1990). “Assessing the Political Landscape: Structure, Cognition, and Power in Organizations.” Administrative Science Quarterly 35:342–369.

Krebs, V. (2002). “Uncloaking Terrorist Networks.” First Monday 7. 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.

Kumar, R., and Li, H. (1994). “On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound.” http://home.eng.iastate.edu/~rkumar/PUBS/atsp.pdf.

Lancichinetti, A., and Fortunato, S. (2009). “Community Detection Algorithms: A Comparative Analysis.” Physical Review E 80:056117–056128.

Landes, W. M., and Posner, R. A. (1976). “Legal Precedent: A Theoretical and Empirical Analysis.” Journal of Law and Economics 19:249–307.

Mihalcea, R. (2005). “Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-Based Algorithms for Sequence Data Labeling.” In Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, 411–418. Vancouver.

Newman, M. E. J. (2010). Networks: An Introduction. Oxford: Oxford University Press.

Raghavan, U. N., Albert, R., and Kumara, S. (2007). “Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks.” Physical Review E 76:36106–36117.

Rochat, Y. (2009). “Closeness Centrality Extended to Unconnected Graphs: The Harmonic Centrality Index.” Paper presented at Sixth Applications of Social Network Analysis Conference, Zurich. http://infoscience.epfl.ch/record/200525/files/[EN]ASNA09.pdf.

Ronhovde, P., and Nussinov, Z. (2010). “Local Resolution-Limit-Free Potts Model for Community Detection.” Physical Review E 81:46114–46129.

Sinha, R., and Mihalcea, R. (2007). “Unsupervised Graph-Based Word Sense Disambiguation Using Measures of Word Semantic Similarity.” In Proceedings of the IEEE International Conference on Semantic Computing, 363–369. Los Alamitos, CA: IEEE Computer Society Press.

Sleijpen, G. L. G., and van der Vorst, H. A. (2000). “A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems.” SIAM Review 42:267–293.

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.

Traag, V. A., Van Dooren, P., and Nesterov, Y. (2011). “Narrow Scope for Resolution-Limit-Free Community Detection.” Physical Review E 84:016114 (1–9). 10.1103/PhysRevE.84.016114. http://pre.aps.org/abstract/PRE/v84/i1/e016114.

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

Zachary, W. W. (1977). “An Information Flow Model for Conflict and Fission in Small Groups.” Journal of Anthropological Research 33:452–473.