Programs

By Lionel Tabourier. Source code in OCaml.
Please cite: RankMerging: a supervised learning-to-rank framework to predict links in large social networks. Machine Learning Journal 2019.

By Maximilien Danisch. Source code in C.
Please cite: Listing k-cliques in Sparse Real-World Graphs. WWW 2018.

By Robin Lamarche-Perrin. Source code in C++.
Please cite: An information-theoretic framework for the lossy compression of link streams. Theoretical Computer Science 2018.

By Léonard Panichi. Source code in C++.
Please cite: An information-theoretic framework for the lossy compression of link streams. Theoretical Computer Science 2018.

By Maximilien Danisch. Source code in C.
Please cite: Large Scale Density-friendly Graph Decomposition via Convex Programming. WWW 2017.

By Matthieu Latapy and Elie Rotenberg. Source code in C.
Please cite: Rigorous Measurement of the Internet Degree Distribution. Complex Systems 2017.

By Maximilien Danisch. Source code in C.
Please cite: Finding Heaviest k-Subgraphs and Events in Social Media. ICDMW 2016.

By Matthieu Latapy, Clémence Magnien and Frédéric Ouedraogo. Source code in C.
Please cite: A Radar for the Internet. Complex Systems 2011.

By Lionel Tabourier. Source code in OCaml.
Please cite: Generating constrained random graphs using multiple edge switches. Journal of Experimental Algorithmics 2011.

By Clémence Magnien and Matthieu Latapy. Source code in C.
Please cite: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. Journal of Experimental Algorithmics 2009.

By Matthieu Latapy. Source code in C.
Please cite: Main-memory Triangle Computations for Very Large (Sparse (Power-Law)) Graphs. Theoretical Computer Science 2008.

By Matthieu Latapy. Source code in C.
Please cite: Basic Notions for the Analysis of Large Two-mode Networks. Social Networks 2008.

By Vincent Blondel, Jean-Loup Guillaume, Renaud Lambiotte and Etienne Lefebvre. Source code in C++.
Please cite: Fast unfolding of communities in large networks. Journal of Statistical Mechanics 2008.

By Pascal Pons. Source code in C++.
Please cite: Computing communities in large networks using random walks. Journal of Graph Algorithms and Applications 2006.

By Paris traceroute team. Source code in C++.
Please cite: Avoiding traceroute anomalies with Paris traceroute. SIGCOMM 2006.

By Fabien Viger. Source code in C++.
Please cite: Random generation of large connected simple graphs with prescribed degree distribution. COCOON 2005.