DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Chang-Sup | - |
dc.contributor.advisor | 성창섭 | - |
dc.contributor.author | Lee, Sung-Kyung | - |
dc.contributor.author | 이성경 | - |
dc.date.accessioned | 2011-12-14T04:17:39Z | - |
dc.date.available | 2011-12-14T04:17:39Z | - |
dc.date.issued | 1991 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67914&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41374 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 1991.8, [ [ii], 42 p. ] | - |
dc.description.abstract | An undirected network with n nodes has at most n(n-1)/2 maximum flow values, each being represented in one of n-1 distinct flow values. Defining a free are as an arc in a cycle which is not included in other cycles, it is shown that such a free arc can be squeezed into the rest of the arcs in the cycle with the node-to-node flow still reserved in the network. Then, an arc-squeezing procedure is exploited to break all the cycles contained in the network by its implementing sequentially on each of them and finally to construct a cut-tree, directly transformed from the network. By the arc-squeezing algorithm, multi-terminal network flow problems can be solved in the computational complexity of O(n3), which is much more efficient than any other maximum flow algorithms. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | (An) arc-squeezing approach to cut-tree construction for undirected networks | - |
dc.title.alternative | 아크병합에 의한 무방향네트웍의 최대흐름용량분석 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 67914/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 000871716 | - |
dc.contributor.localauthor | Sung, Chang-Sup | - |
dc.contributor.localauthor | 성창섭 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.