====== Algoritms ======

[[:net|Back to networks]]

  * http://code.google.com/p/graphbook/
  * http://buzzard.pugetsound.edu/sage-practice/
  * http://sna.unimelb.edu.au/PNet

===== Bandwidth and profile =====


  * Gibbs, N. E., Poole, W. G., Jr. and Stockmeyer, P. K.: An Algorithm for Reducing the  
  * An Improved Matrix Bandwidth and Profile Reduction Algorithm in 
  * Q. Wang and X.-W. Shi: [[http://www.jpier.org/PIERL/pier.php?paper=09042305|An improved algorithm for matrix bandwidth and profile reduction in finite element analysis]]. PIER Letters, Vol. 9, pp. 29-38
  * Ilona Aranyi: [[http://ac.inf.elte.hu/Vol_004_1983/029.pdf|The method of Gibbs—Poole—Stockmeyer is non-heuristic]]. ANNALES. Sectio Computatorica
  * http://ac.inf.elte.hu/Vol_004_1983/029.pdf
  * [[http://www.hsl.rl.ac.uk/specs/mc60.pdf|MC60]]
  * W.F. Smyth [[http://www.sciencedirect.com/science/article/pii/0377042785900482|Algorithms for the reduction of matrix bandwidth and profile]]. Journal of Computational and Applied Mathematics, Vol. 12–13, May 1985, Pages 551–561
  * Gary Kumfert, Alex Pothen: [[http://link.springer.com/article/10.1007%2FBF02510240?LI=true#page-1|Two improved algorithms for envelope and wavefront reduction]]. BIT Numerical Mathematics, September 1997, Volume 37, Issue 3, pp 559-590
  * Q. Wang, Y.-C. Guo, and X.-W. Shi: [[http://www.jpier.org/PIER/pier.php?paper=09010512|A generalized gps algorithm for reducing the bandwidth and profile of a sparse matrix]]. PIER Letters, Vol. 90, pp. 121-136
  * J.K. Reid and J.A. Scott: [[http://epubs.siam.org/doi/abs/10.1137/050629938|Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix]]. SIAM. J. Matrix Anal. & Appl., 28(3), 805–821. http://dx.doi.org/10.1137/050629938
  * Behrooz Koohestani, Riccardo Poli: [[http://link.springer.com/chapter/10.1007%2F978-3-642-15871-1_49?LI=true#page-1|A Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem]]. Parallel Problem Solving from Nature, PPSN XI, Lecture Notes in Computer Science Volume 6239, 2010, pp 482-491
  * Andrew J. McAllister: [[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.153&rep=rep1&type=pdf|A new heuristic algorithm for the linear arrangement problem]].

  * Kaveh A. [[http://www.lavoisier.fr/livre/notice.asp?ouvrage=1338671|Optimal Structural Analysis]], (2nd Ed.)


===== Ord =====

  * Vincent D Blondel et al [[http://dx.doi.org/10.1088/1742-5468/2008/10/P10008|Fast unfolding of communities in large networks]]. J. Stat. Mech. (2008) P10008 doi:10.1088/1742-5468/2008/10/P10008
  * Gephi Wiki: [[http://wiki.gephi.org/index.php/OpenOrd|OpenOrd]]
  * Shawn Martin et al [[http://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=731088|OpenOrd: an open-source toolbox for large graph layout]] Proc. SPIE 7868, Visualization and Data Analysis 2011, 786806 (January 24, 2011); doi:10.1117/12.871402 
  * Boyack KW, et al [[http://www.plosone.org/article/info%3Adoi/10.1371/journal.pone.0018029|Clustering More than Two Million Biomedical Publications: Comparing the Accuracies of Nine Text-Based Similarity Approaches]]. PLoS ONE 6(2011)(3): e18029. doi:10.1371/journal.pone.0018029
  * Software by Shawn Martin: [[http://www.cs.otago.ac.nz/homepages/smartin/software.php|OpenOrd]]

===== Clustering =====


  * www.oslom.org/oslom.pdf
 
===== 3-connectivity =====

  *  Gary L. Miller , Vijaya Ramachandran: [[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.5494|A new graph triconnectivity algorithm and its parallelization]] (1987)
  * A Saifullah: [[http://cse.wustl.edu/Research/Lists/Technical%20Reports/Attachments/856/TRICONN.pdf|A Simple Algorithm For Triconnectivity of a Multigraph]]
  * http://code.google.com/p/jbpt/
  * Hopcroft, John E., Tarjan, Robert Endre: [[http://ecommons.library.cornell.edu/bitstream/1813/6037/1/74-197.pdf|Dividing a Graph into Triconnected Components]]
  * http://magma.maths.usyd.edu.au/magma/handbook/text/1728
  * https://github.com/adrianN/Triconnectivity ; http://www.mpi-inf.mpg.de/%7Eaneumann/masterarbeit.pdf
  * Amr Elmasry: [[http://link.springer.com/chapter/10.1007%2F978-3-642-17514-5_32|Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs]]
  * YH Tsin: [[http://crpit.com/confpapers/CRPITV128Tsin.pdf|Decomposing a Multigraph into Split Components]]
  * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5176

===== Planarity =====

===== Coefficients =====

  * http://en.wikipedia.org/wiki/Distance_%28graph_theory%29
  * http://www.mast.queensu.ca/~ggsmith/Math401/project.html
  * http://en.wikipedia.org/wiki/Resistance_distance
  * http://toreopsahl.com/publications/thesis/thesis-5-2-weighted-network-functions/

  * http://www.mat.uniroma2.it/~tvmsscho/Rome-Moscow_School/2012/files/Exercises_Fasino_2012.pdf
  * http://www.mat.uniroma2.it/~tvmsscho/Rome-Moscow_School/2012/pages/lect_course.php

===== Backbone =====

  * Kossinets, G., Kleinberg, J., & Watts, D. (2008). The structure of information pathways in a social communication network. In 14th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 435–443).
  * I do not know enough about what you hope to use the concept for.  From the abstract of Kossinets et al, I see one thing missing that I would include: A different temporal dimension.  In my work with risk networks in communities, I sometimes think of the long-term relationships as providing a basic spinal structure, with the relatively short term and even episodic "froth" as other aspects of it.  	"Sam Friedman"

===== External =====

  * http://arxiv.org/pdf/1106.6336
  * http://www.datalab.uci.edu/muri/january2012/slides/GoodrichMURI2012.pdf
  * http://wadam.dis.uniroma1.it/index.php/research-areas/social-network-analysis
  * http://www.win.tue.nl/~hermanh/teaching/2IL35/AMM/04-elementary-graph-algorithms.pdf
  * http://www.win.tue.nl/~hermanh/teaching/2IL35/AMM/
  * http://www.win.tue.nl/~hermanh/teaching/2IL35/
  * http://www.cs.ucc.ie/~da5/papers.shtml
  * http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5767911
  * http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.147.3224&rep=rep1&type=pdf
  * http://www.ae.cs.uni-frankfurt.de/pdf/diss_uli.pdf
  * http://www.ae.cs.uni-frankfurt.de/?p=staff&s=staff&t=uli
  * http://www.lume.ufrgs.br/bitstream/handle/10183/26335/000757756.pdf
  * http://adambuchsbaum.com/papers/func-esa98.pdf
  * http://www14.in.tum.de/lehre/2007WS/anga/index.html.de
  * http://link.springer.com/chapter/10.1007%2F978-3-642-33090-2_8#page-1
  * http://link.springer.com/chapter/10.1007%2F978-3-540-69903-3_38#page-1
  * http://dl.acm.org/citation.cfm?id=2043654
  * http://www.ae.cs.uni-frankfurt.de/?p=research&s=research&t=R_DFG1307
  * http://algs.di.uniroma1.it/research.php
  * http://doc.aidounix.com/maths/graphs/triangles.pdf
  * http://staff.vbi.vt.edu/maleq/papers/sc12-poster-abstract.pdf
  * http://link.springer.com/chapter/10.1007%2F3-540-68530-8_1#page-1
  * http://www.ti.inf.ethz.ch/ew/lehre/EMADS04/
  * https://www.researchgate.net/publication/3675053_Improved_algorithms_and_data_structures_for_solving_graph_problemsin_external_memory

===== Mix =====

  * http://dhs.stanford.edu/dh/networks/ ; https://dhs.stanford.edu/algorithmic-literacy/learning-network-analysis-and-representation-with-a-pedagogical-toy/
  * http://www-958.ibm.com/software/analytics/manyeyes/visualizations/incorrect-data-test-network-diagra
  * http://vis.mediaartresearch.at/webarchive/public/view/mid:10 ; http://vis.mediaartresearch.at/webarchive/public/view/mid:1
  * http://nodexl.codeplex.com/ ; http://www.nodexlgraphgallery.org/Pages/Default.aspx ; http://nodexl.codeplex.com/wikipage?title=NodeXL%20Teaching%20Resources ;