Improved Algorithms for the Finding of the Minimum k-way Cuts for k = 3, 4, 5, and 6
碩士 === 國立清華大學 === 資訊工程學系 === 91 === Let G = (V, E) be an undirected graph with vertex set V and edge set E. Let n = |V| and m = |E|. Each e Î E has a positive weight. For k ³ 2, the minimum k-way cut problem is to find a set of edges whose removal partitions V into k non-empty disjoint subsets such...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60516864565674410732 |