Links
Resources
- RanDist: A companion repository for the paper "On the Distance Between Random Events in a Network". Compute distance related statistics between events in a given network
- dOmega: Implementation of an efficient algorithm for the maximum clique problem that runs in time polynomial in the graph's size, but exponential in the clique-core gap g:=(d+1)-omega (where d denotes the graph's degeneracy and omega the size of the largest clique). A companion repository for the paper "Why is maximum clique often easy in practice".
- Graph Partitioning: A companion for the paper Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations.
