#### License

Copyright © 2005-2009 by Dimitris V. Kalamaras.
Blog: http://dimitris.apeiro.gr

This documentation is licensed under the terms of the GNU Free Documentation License.

This program is licensed under the terms of the GNU General Public License as published by the Free Software Foundation http://www.gnu.org/licenses/gpl.html. You have the right to use and copy it, study, modify and then redistribute the revised source code as long as you keep the source code free for the others. For a complete list of your rights and obligations by using this program please read the GPL.

#### Credits

Many thanks to:

- Serafeim Zanikolas (Debian packager)
- Markos Chandras (Gentoo packager)
- Tom Tryfonidis (Arch packager)
- Daniel Pinto dos Santos, for the German translation
- Andre Somers, for bug fixing and useful comments
- Thomas Ingold, for betweeness bug reporting
- Steven Orr, for bug reporting
- Fred March, for bug reporting
- Alejandro Garrido Mota (Debian packager)
- Martin Hohenberg
- Victor Cardoso
- Paul Johnson
- David de Ugarte, for an older Spanish translation

#### References

- Brandes, Ulrik (2001). A Faster Algorithm for Betweeness Centrality. Journal of Mathematical Sociology 25(2), pp.163-177.
- Brandes, Ulrik (2001). Drawing on Physical Analogies.In M. Kaufmann and D. Wagner (Eds.): Drawing Graphs: Methods and Models. LNCS Tutorial 2025, pp. 71-86.
- Dasgupta S., Papadimitriou C.H. & Vazirani U.V. (2006). Algorithms.
- Davis, J. A. & Leinhardt S. (1972). The Structure of Positive Relations in Small Groups.In J. Berger (Ed.), Sociological Theories in Progress , vol. 2. pp. 218-51. Boston, MA: Houghton Mifflin.
- Holland, P.W. & Leinhardt. S. (1970). A Method for Detecting Structure in Sociometric Data. American Journal of Sociology 70: 492-513.
- Holland, P.W. & S. Leinhardt. (1971). Transitivity in Structural Models of Small Groups. Comparative Group Studies 2:107-124.
- Holland, P.W. & S. Leinhardt. (1975). Local Structure in Social Networks. Sociological Methodology<.em> 1976: 1-45.
- Eades, P, (1984). A Heuristic for Graph Drawing. Congressus Numerantuum, 42:149-160.
- Erdos, P. and Renyi, A. (1959). On Random Graphs. I. Publicationes Mathematicae 6: 290-297.
- Erdos, P. and Renyi, A. (1960). The Evolution of Random Graphs. Magyar Tud. Akad. Mat. Kutat Int. Kol. 5: 17-61.
- Watts, D.J., Strogatz, S.H. (1998). Collective dynamics of 'small-world' networks. Nature 393 (6684): 409–10.
- Schank, T and Wagner. D (2005). Approximating Clustering Coefficient and Transitivity. J. Graph Algorithms Appl. 9(2): 265-275
- Fruchterman, T.M.J. & Reingold, E.M. (1991). Graph Drawing by Force-Directed Placement. Software-Practice & Experience. Vol. 21, Is. 11, pp. 1129-1164.
- Liu, C.L. (2000). Elements of Discrete Mathematics 2nd Edition. Greek Translation.
- Press W., Teukolsky S., Vetterling W. & Flannery B. (1992). Numerical Recipes in C, the art of scientific computing.
- Stroustrup B. (1997). The C++ Programming Language.
- Scott, J. (2000). Social Network Analysis, A handbook.
- Trolltech ASA (2009). QtAssistant. Version 4.4 Open Source Edition.
- Wasserman S., Faust K. (2000). Social Network Analysis. Methods and Applications.