Browse "School of Computing(전산학부)" by Subject geometric network

Showing results 1 to 2 of 2

1
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

2
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

Type

. next

Open Access

Date issued

. next

Subject

. next

rss_1.0 rss_2.0 atom_1.0