The igraph software package for complex network research. igraph is a free software package for creating and manipulating undirected and directed graphs. It includes implementations for classic graph theory problems like minimum spanning trees and network flow, and also implements algorithms for some recent network analysis methods, like community structure search. The efficient implementation of igraph allows it to handle graphs with millions of vertices and edges. The rule of thumb is that if your graph fits into the physical memory then igraph can handle it.

References in zbMATH (referenced in 85 articles )

Showing results 1 to 20 of 85.
Sorted by year (citations)

1 2 3 4 5 next

  1. Ansmann, Gerrit: Efficiently and easily integrating differential equations with JiTCODE, JiTCDDE, and JiTCSDE (2018)
  2. Embrechts, P.; Kirchner, M.: Hawkes graphs (2018)
  3. Fairbrother, Jamie; Letchford, Adam N.; Briggs, Keith: A two-level graph partitioning problem arising in mobile wireless communications (2018)
  4. Goerigk, Marc; Hamacher, Horst W.; Kinscherff, Anika: Ranking robustness and its application to evacuation planning (2018)
  5. Pirim, Harun; Eksioglu, Burak; Glover, Fred W.: A novel mixed integer linear programming model for clustering relational networks (2018)
  6. Song, Jiangning; Li, Fuyi; Takemoto, Kazuhiro; Haffari, Gholamreza; Akutsu, Tatsuya; Chou, Kuo-Chen; Webb, Geoffrey I.: PREvaIL, an integrative approach for inferring catalytic residues using sequence, structural, and network features in a machine-learning framework (2018)
  7. Álvarez-Miranda, Eduardo; Sinnl, Markus: A relax-and-cut framework for large-scale maximum weight connected subgraph problems (2017)
  8. Arcagni, Alberto; Grassi, Rosanna; Stefani, Silvana; Torriero, Anna: Higher order assortativity in complex networks (2017)
  9. Baumer, Benjamin S.; Kaplan, Daniel T.; Horton, Nicholas J.: Modern data science with R (2017)
  10. Benjamin R. Fitzpatrick, Kerrie Mengersen: A network flow approach to visualising the roles of covariates in random forests (2017) arXiv
  11. Bo Wang, Daniele Ramazzotti, Luca De Sano, Junjie Zhu, Emma Pierson, Serafim Batzoglou: SIMLR: a tool for large-scale single-cell analysis by multi-kernel learning (2017) arXiv
  12. Bryon Aragam, Jiaying Gu, Qing Zhou: Learning Large-Scale Bayesian Networks with the sparsebn Package (2017) arXiv
  13. Cinelli, Matteo; Ferraro, Giovanna; Iovanella, Antonio: Resilience of core-periphery networks in the case of rich-club (2017)
  14. Das, Bikramjit; Resnick, Sidney I.: Hidden regular variation under full and strong asymptotic dependence (2017)
  15. Dehmer, Matthias (ed.); Shi, Yongtang (ed.); Emmert-Streib, Frank (ed.): Computational network analysis with R. Applications in biology, medicine and chemistry (2017)
  16. Deisy Morselli Gysi, Andre Voigt, Tiago de Miranda Fragoso, Eivind Almaas, Katja Nowick: wTO: an R package for computing weighted topological overlap and consensus networks with an integrated visualization tool (2017) arXiv
  17. D. Ranathunga, H. Nguyen, M. Roughan: MGtoolkit: A python package for implementing metagraphs (2017)
  18. Gross, Elizabeth; Petrović, Sonja; Stasi, Despina: Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs (2017)
  19. Gunturi, Venkata M. V.; Shekhar, Shashi; Joseph, Kenneth; Carley, Kathleen M.: Scalable computational techniques for centrality metrics on temporally detailed social network (2017)
  20. Jacob van Etten: R Package gdistance: Distances and Routes on Geographical Grids (2017)

1 2 3 4 5 next