DSpace at KOASAS
Browsing DSpace

Browse by Subject SPANNERS

A to Z

All 0-9

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:

Showing results 1 to 3 of 3

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, B; de Berg, M; Cheong, Otfried; Gudmundsson, J; Haverkort, H; Vigneron, A, ALGORITHMS AND COMPUTATION BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3827, pp.50 - 59, 2005

3
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

rss_1.0 rss_2.0 atom_1.0