DSpace at KOASAS
College of Engineering(공과대학)School of Computing(전산학부)CS-Conference Papers(학술회의논문)

Computing a minimum-dilation spanning tree is NP-hard

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 369
  • Download : 0
Export
Cheong, Otfriedresearcher / Haverkort, Herman / Lee, Mira
Publisher
CATS '07
Issue Date
2007-01-30
Language
English
Citation

Computing: The Australasian Theory Symposium (CATS) 2007, pp.15 - 24

URI
http://hdl.handle.net/10203/159206
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

Display Full Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0