Search results for "dist:Graph-Bipartite DETZOLD"
Graph::Bipartite - Graph algorithms on bipartite graphs.
This algorithm computes the maximum matching of a bipartite unweighted and undirected graph in worst case running time O( sqrt(|V|) * |E| ). The constructor takes as first argument the number of vertices of the first partition V1, as second argument ...
DETZOLD/Graph-Bipartite-0.01 - 25 May 2003 21:25:37 UTC