최소 갯수의 Via 를 갖는 rectilinear steiner tree 문제에 대한 알고리즘An algorithm for rectilinear steiner trees with the minimum number of vias

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 439
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisor좌경룡-
dc.contributor.advisorChwa, Kyung-Yong-
dc.contributor.author최윤경-
dc.contributor.authorChoi, Yoon-Kyoung-
dc.date.accessioned2011-12-13T05:51:55Z-
dc.date.available2011-12-13T05:51:55Z-
dc.date.issued1988-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=66232&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/33795-
dc.description학위논문(석사) - 한국과학기술원 : 전산학과, 1988.2, [ 1책(면수복잡) ]-
dc.languagekor-
dc.publisher한국과학기술원-
dc.title최소 갯수의 Via 를 갖는 rectilinear steiner tree 문제에 대한 알고리즘-
dc.title.alternativeAn algorithm for rectilinear steiner trees with the minimum number of vias-
dc.typeThesis(Master)-
dc.identifier.CNRN66232/325007-
dc.description.department한국과학기술원 : 전산학과, -
dc.identifier.uid000861441-
dc.contributor.localauthor좌경룡-
dc.contributor.localauthorChwa, Kyung-Yong-
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0