DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Chang-Sup | - |
dc.contributor.advisor | 성창섭 | - |
dc.contributor.author | Lee, Young-Rai | - |
dc.contributor.author | 이영래 | - |
dc.date.accessioned | 2011-12-14T04:14:24Z | - |
dc.date.available | 2011-12-14T04:14:24Z | - |
dc.date.issued | 1984 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=64201&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41153 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 1984.2, [ [ii], 29 p. ] | - |
dc.description.abstract | This thesis presents a direct decomposition method for finding K shortest paths in an acyclic network based on a sher``s algebra [1]. In this method, unlike the iterative methods of shier [1,2], triangularity of an acyclic network is utilized, in the sense that it implements recursively only the non-trivial operations. The computational complexity to obtain the K shortest paths from node s to all other nodes (or from all the nodes to node s) is O($Ks^2$). Graph-theoretic interpretation and a method of recording paths are also included. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | Direct composition method for K shortest paths in an acylic network | - |
dc.title.alternative | 비순환 네트웍의 K 최단경로 탐색을 위한 직접 분할 기법 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 64201/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 000821236 | - |
dc.contributor.localauthor | Sung, Chang-Sup | - |
dc.contributor.localauthor | 성창섭 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.