luby
Generate fountain codes / erasure codes (Luby Transform, robust)
Generate fountain codes / erasure codes (Luby Transform, robust)
A D3 layout for drawing weighted bipartite graphs.
Finds a maximum matching of a bipartite graph
A hungarian algorithm that runs in O(n^3)
Maximum unweighted bipartite matching
An algorithm for maximum cardinality matching of bipartite graph
Generate fountain codes / erasure codes (Luby Transform, robust)
Maximum independent set for bipartite graph
Minimal vertex cover for bipartite graphs
Finds a maximum matching of a bipartite graph
Interactive bipartite graph layout
Bipartite graph functions for graphology.
A lightweight and efficient implementation of the Munkres (Hungarian) algorithm for optimal assignment in square and rectangular matrices.