Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - bipartite graphs

Search list

[Mathimatics-Numerical algorithms] random_bipartite

Description: 生成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
Platform: | Size: 2522 | Author: 阿类 | Hits:

[Mathimatics-Numerical algorithms] random_bipartite

Description: 生成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
Platform: | Size: 2048 | Author: 阿类 | Hits:

[CSharp] BipartiteGraphs

Description: Bipartite Graphs for Graph Teory
Platform: | Size: 138240 | Author: mustafa | Hits:

[Algorithm] assignment_2009_12_01

Description: This source code solves the assignment problem in Bipartite graphs by implementing the Hungarian Algorithm.
Platform: | Size: 16384 | Author: Omid | Hits:

[Special Effects] bipmatch

Description: This source code solves the matching problem in bipartite graphs by implementing the Hungarian Algorithm.
Platform: | Size: 117760 | Author: Omid | Hits:

[Algorithm] Hungarian

Description: 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.
Platform: | Size: 3072 | Author: Omid | Hits:

[Software Engineering] Xong

Description: 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
Platform: | Size: 2128896 | Author: huy | Hits:

[Other] hungrian

Description: 匈牙利算法的源代码，可以解决二分图的最大匹配问题-Hungarian algorithm source code, can solve the maximum matching problem for bipartite graphs
Platform: | Size: 1024 | Author: Niker | Hits:

[matlab] graph-coloring

Description: 基于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.
Platform: | Size: 1024 | Author: joran | Hits:

[Windows Develop] C

Description: KM算法可以计算二分图的最大权匹配，匈牙利算法可以计算最大匹配(KM algorithm can calculate the maximum weight matching of bipartite graphs, Hungary algorithm can calculate the maximum matching.)
Platform: | Size: 1024 | Author: xxxlll32 | Hits:

CodeBus www.codebus.net