Search - bipartite graphs

Search - bipartite graphs - List

[Mathimatics-Numerical algorithms] random_bipartite DL : 0: 生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test-Generation Bipartite Graphs. / Distributions-u-m 1-M 10-n 100-500's
Update : 2008-10-13 Size : 2.46kb Publisher : 阿类
[Mathimatics-Numerical algorithms] random_bipartite DL : 0: 生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test-Generation Bipartite Graphs./Distributions-u-m 1-M 10-n 100-500's
Update : 2025-02-17 Size : 2kb Publisher : 阿类
[CSharp] BipartiteGraphs DL : 0: Bipartite Graphs for Graph Teory
Update : 2025-02-17 Size : 135kb Publisher : mustafa
[Algorithm] assignment_2009_12_01 DL : 0: This source code solves the assignment problem in Bipartite graphs by implementing the Hungarian Algorithm.
Update : 2025-02-17 Size : 16kb Publisher : Omid
[Special Effects] bipmatch DL : 0: This source code solves the matching problem in bipartite graphs by implementing the Hungarian Algorithm.
Update : 2025-02-17 Size : 115kb Publisher : Omid
[Algorithm] Hungarian DL : 0: This source code is one version of Hungarian Algorithm used in bipartite graphs. For more information please refer to source codes.-This source code is one version of Hungarian Algorithm used in bipartite graphs. For more information please refer to source codes.
Update : 2025-02-17 Size : 3kb Publisher : Omid
[Software Engineering] Xong DL : 0: A matchings in a graph is a set of edges, no two which share an endpoint. In this section we show how to find maximum matchings in bipartite graphs
Update : 2025-02-17 Size : 2.03mb Publisher : huy
[Other] hungrian DL : 0: 匈牙利算法的源代码，可以解决二分图的最大匹配问题-Hungarian algorithm source code, can solve the maximum matching problem for bipartite graphs
Update : 2025-02-17 Size : 1kb Publisher : Niker
[matlab] graph-coloring DL : 0: 基于greedy DSATUR 的经典着色程序-Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However for some specific graph classes there are some positif results. For example by definition we can trivially color a bipartite graph using two colors.
Update : 2025-02-17 Size : 1kb Publisher : joran
[Windows Develop] C DL : 0: KM算法可以计算二分图的最大权匹配，匈牙利算法可以计算最大匹配(KM algorithm can calculate the maximum weight matching of bipartite graphs, Hungary algorithm can calculate the maximum matching.)
Update : 2025-02-17 Size : 1kb Publisher : xxxlll32