서지주요정보
(An) arc-squeezing approach to cut-tree construction for undirected networks = 아크병합에 의한 무방향네트웍의 최대흐름용량분석
서명 / 저자 (An) arc-squeezing approach to cut-tree construction for undirected networks = 아크병합에 의한 무방향네트웍의 최대흐름용량분석 / Sung-Kyung Lee.
저자명 Lee, Sung-Kyung ; 이성경
발행사항 [대전 : 한국과학기술원, 1991].
Online Access 제한공개(로그인 후 원문보기 가능)원문

소장정보

등록번호

8002522

소장위치/청구기호

학술문화관(문화관) 보존서고

MIE 9132

SMS전송

도서상태

이용가능

대출가능

반납예정일

초록정보

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($n^3$), which is much more efficient than any other maximum flow algorithms.

서지기타정보

서지기타정보
청구기호 {MIE 9132
형태사항 [ii], 42 p. : 삽도 ; 26 cm
언어 영어
일반주기 저자명의 한글표기 : 이성경
지도교수의 영문표기 : Chang-Sup Sung
지도교수의 한글표기 : 성창섭
학위논문 학위논문(석사) - 한국과학기술원 : 산업공학과,
서지주기 Reference : p. 40-42
주제 Industrial capacity.
Flow chart.
네트워크. --과학기술용어시소러스
용량 (성질) --과학기술용어시소러스
최대 흐름 문제. --과학기술용어시소러스
Network analysis (Planning)
QR CODE qr code