igraph: Network Analysis and Visualization
Gábor Csárdi, Tamás Nepusz, Vincent Traag et al. · 2006
Routines for simple graphs and network analysis. It can handle large graphs very well and provides functions for generating random and regular graphs, graph visualization, centrality methods and much more.
Cited by 121 works. doi:10.32614/cran.package.igraph Open-access PDF
Authors
- Gábor Csárdi
- Tamás Nepusz
- Vincent Traag
- Szabolcs Horvát
- Fabio Zanini
- Daniel Noom
- Kirill Müller
- David Schoch
References
- Centrality in social networks conceptual clarification
- The igraph software package for complex network research
- A faster algorithm for betweenness centrality*
- Maps of random walks on complex networks reveal community structure
- An algorithm for finding shortest routes from all source nodes to a given destination in general networks
- Connected Components in Random Graphs with Given Expected Degree Sequences
- Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups
- Statistical mechanics of networks
- The map equation
- The phase transition in inhomogeneous random graphs