Voronol digram 과 euclidean minimum spanning tree 를 구하기 위한 on-line algorithmOn-line algorithms for voronol diagram and euclidean minimum spanning tree
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 좌경룡 | - |
| dc.contributor.advisor | Chwa, Kyung-Yong | - |
| dc.contributor.author | 허성우 | - |
| dc.contributor.author | Hur, Sung-Woo | - |
| dc.date.accessioned | 2011-12-13T05:48:43Z | - |
| dc.date.available | 2011-12-13T05:48:43Z | - |
| dc.date.issued | 1983 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=63752&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/33576 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1983.2, [ [ii], 39, [3] p. ] | - |
| dc.language | kor | - |
| dc.publisher | 한국과학기술원 | - |
| dc.title | Voronol digram 과 euclidean minimum spanning tree 를 구하기 위한 on-line algorithm | - |
| dc.title.alternative | On-line algorithms for voronol diagram and euclidean minimum spanning tree | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 63752/325007 | - |
| dc.description.department | 한국과학기술원 : 전산학과, | - |
| dc.identifier.uid | 000811305 | - |
| dc.contributor.localauthor | 좌경룡 | - |
| dc.contributor.localauthor | Chwa, Kyung-Yong | - |
- 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.