Location:
Search - dsatur
Search list
Description: Algorithm colouring graph minimum numbers of colours. Dsatur heuristic algorithm.
Platform: |
Size: 2048 |
Author: xssk |
Hits:
Description: exact DSATUR algorithm colouring grapg minimum number of colours
Platform: |
Size: 2048 |
Author: xssk |
Hits:
Description: 蜂窝着色问题算法代码 实现了Dsatur算法 GB-DFR和GB-DFR改进算法-failed to translate
Platform: |
Size: 11264 |
Author: 张昕 |
Hits:
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:
Description: DSATUR algorithme de coloration des graphe dsatur
Platform: |
Size: 1024 |
Author: moha1921 |
Hits: