• Corpus ID: 16923281

The igraph software package for complex network research

  title={The igraph software package for complex network research},
  author={G{\'a}bor Cs{\'a}rdi and Tam{\'a}s Nepusz},
There is no other package around that satisfies all the following requirements: •Ability to handle large graphs efficiently •Embeddable into higher level environments (like R [6] or Python [7]) •Ability to be used for quick prototyping of new algorithms (impossible with “click & play” interfaces) •Platform-independent and open source igraph aims to satisfy all these requirements while possibly remaining easy to use in interactive mode as well. 

Figures from this paper

The biGraph – package Version 0 . 9-3

This package is an extension to the igraph–package and provides a set of tools specifically aimed at the analysis of bipartite graphs, specifically concerning the associated information loss.

NetworKit: A tool suite for large-scale complex network analysis

The methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficient data structures, and modular software architecture are described.

Interactive network exploration with Orange

This paper presents a tool, an add-on for exploration of networks within the general component-based environment Orange, that addresses the challenges of interactively and graphically manipulating the networks.

IGraph/M: graph theory and network analysis for Mathematica

IGraph/M serves as the Wolfram Language interfaces to the igraph C library, and provides several unique pieces of functionality not yet present in igraph, but made possible by combining its capabilities with Mathematica’s.

NetworKit: An Interactive Tool Suite for High-Performance Network Analysis

This work introduces NetworKit, an open-source software package for high-performance analysis of large complex networks and satisfying three important criteria: high performance, interactive workflows and integration into an ecosystem of tested tools for data analysis and scientific computation.

Graph-XLL: a Graph Library for Extra Large Graph Analytics on a Single Machine

This paper introduces Graph-XLL: a graph library implemented using the WebGraph framework in a vertex-centric manner, with much less memory requirement compared to igraph and NetworkX.

retworkx: A High-Performance Graph Library for Python

License Authors of papers retain copyright and release the work under a Creative Commons Attribution 4.0 International License (CC BY 4.0). Network and graph analysis is a widely applicable field of

Graph Processing System for Network Science

  • M. Chernoskutov
  • Computer Science
    2020 International Conference Engineering and Telecommunication (En&T)
  • 2020
A high-level description of a system that allows to develop graph algorithms efficiently and increase productivity of software developer and can be used to build efficient data structures for storing graphs.

The network makeup artist (NORMA-2.0): Distinguishing annotated groups in a network using innovative layout strategies

This version of NORMA-2.0 is a web application which uses efficient layouts to group together areas of interest in a network while preserving all of the properties from its first version where one can handle multiple networks and annotation files simultaneously.

Network Exploration by Complements of Graphs with Graph Coloring

A simple and quick procedure to explore a network by changing the edge representation based on the complement of a simple graph and the partition method of vertex coloring and the colors provide additional information on top of the partitions.



FANMOD: a tool for fast network motif detection

FANMOD relies on recently developed algorithms to improve the efficiency of network motif detection by some orders of magnitude over existing tools, which facilitates the detection of larger motifs in bigger networks than previously possible.

GraphML Progress Report ? Structural Layer Proposal

GraphML (Graph Markup Language), an XML format for graph structures, is presented as an initial step towards this goal because its main characteristic is a unique mechanism that allows to define extension modules for additional data, such as graph drawing information or data specific to a particular application.

Modularity and community structure in networks.

  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.

Finding community structure in networks using the eigenvectors of matrices.

  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.

Graph drawing by force‐directed placement

A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.

An Atlas of Graphs

With over 10,000 diagrams and extensive tables of properties, this atlas is comprehensive and unique, making it an invaluable source for researchers in graph theory, operations research and computer science.

Exploratory Social Network Analysis with Pajek

This second edition of the successful textbook on social network analysis integrating theory, applications, and network analysis using Pajek has a new chapter on random network models, for example, scale-free and small-world networks and Monte Carlo simulation.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Are randomly grown graphs really random?

It is concluded that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.