(A) study on the modified 2 and 3-center in a tree networkTree network 상에서 modified 2-center 와 3-center 에 관한 연구
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Chwa, Kyung-Yong | - |
| dc.contributor.advisor | 좌경룡 | - |
| dc.contributor.author | Kim, Jong-Cheol | - |
| dc.contributor.author | 김종철 | - |
| dc.date.accessioned | 2011-12-13T05:48:04Z | - |
| dc.date.available | 2011-12-13T05:48:04Z | - |
| dc.date.issued | 1982 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=63353&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/33531 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1982.2, [ [ii], 30, [2] p. ] | - |
| dc.description.abstract | We introduce the formulation of a modified P-center. And efficient algorithms for finding the modified 2-center and modified 3-center of a tree are given. Critical vertices are defined to find the modified 2-center and 3-center. In the modified 2-center, we find an algorithm whose complexity is a linear function of the number of vertices. Also we find a linear time algorithm for the modified 2-center in continuous case. In the modified 3-center, we show that there are at most 4 equivalence classes over the critical vertices and using the fact, we find an $O(n^3)$ algorithm. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.title | (A) study on the modified 2 and 3-center in a tree network | - |
| dc.title.alternative | Tree network 상에서 modified 2-center 와 3-center 에 관한 연구 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 63353/325007 | - |
| dc.description.department | 한국과학기술원 : 전산학과, | - |
| dc.identifier.uid | 000801066 | - |
| dc.contributor.localauthor | Chwa, Kyung-Yong | - |
| dc.contributor.localauthor | 좌경룡 | - |
- Appears in Collection
- CS-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.