Browse "School of Computing(전산학부)" by Subject dilation
Showing results 1 to 3 of 3
| Computing a minimum-dilation spanning tree is NP-hard Cheong, Otfried; Haverkort, Herman; Lee, Mira, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.41, no.3, pp.188 - 205, 2008-11 |
| SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES Cheong, Otfried; Lee, Changryeol, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.23, no.3, pp.159 - 170, 2013-06 |
| Sparse geometric graphs with small dilation Aronov, Boris; de Berg, Mark; Cheong, Otfried; Gudmundsson, Joachim; Haverkort, Herman; Smid, Michiel; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.40, no.3, pp.207 - 219, 2008-08 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,768 2020 - 2024
- 5,388 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989