列舉分割問題及最小 k 分割問題之改進演算法
博士 === 國立清華大學 === 資訊工程學系 === 97 === In this dissertation, we study the cut enumeration problem and the minimum k-cut problem. For the cut enumeration problem, an efficient algorithm with Õ(n^2m) delay between two successive outputs has been known since 1992, due to Vazirani and Yannakakis, where Õ(f...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/44455088238086329098 |