maxdan94 Goto Github PK

are-dynamic

are-dynamic-2017

auction

Efficient C implementation of the auction algorithm of Bertsekas for the assignement problem

bucketsort

C implementation of bucket_sort and arg_bucket_sort

comcore

C code related to the computation of communitiy cores

cosinesparsematrix

Compute the cosine similarity between each pair of nodes in very large directed graphs

cuckoofilter

cut2sort

Recursive graph cuts to obtain an ordering of nodes

datanets-course

This repository includes Lecture Notes and Lab Exercises in Python for a course named "Data Analysis (for Networks)" taught at Sorbonne University. In case you want to use the slides please contact me.

decmod

density-friendly

C implementation of algorithms to find the Density-Friendly graph decomposition

destruct

C code to break the structure of a real-world graph

divhi

Divisive Hierarchical Clustering

f1max

C code to compute a similarity score between two overlapping community structures

graphcut

Some local search algorithms to compute cuts in large sparse graphs

hks

C code to compute a Heaviest k-Subgraph or an approximation

kamis

Maximum independent sets of large sparse graphs.

kcliques

kclist

Algorithms to list k-cliques in real-world graphs

kruskal

Efficient implementation of Kruskal's algorithm using a UnionFind datastruture

libbvg

A C implementation of a Boldi-Vigna graph decompressor

loadgraph

Loading a graph in main memory

loadgraph_limass

louvainne

Implementation of a scalable embedding method suggested in WSDM2020

lp_mincut

Linear programming formulation of mincut solved with MOSEK

maxflow

Efficient C implementation of the Ford-Fulkerson maxflow algorithm

mocda

C code to compute all overlapping communities in a network following a "from local to global approach"

neighsim

These C programs computes some neighborhood-based similarities between each pair of nodes in a very large sparse graph.

open-mcs

An open implementation of the MC family of maximum clique algorithms

parallelunionfind