Searching for "Computing a Minimum-Dilation Spanning Tree is NP-hard." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Computing a minimum-dilation spanning tree is NP-hard
by Otfried Cheong, Herman Haverkort, Mira Lee — 2007 — In Proc. of Computing: The Australasian Theory Symposium, CRPIT
…Computing a Minimum-Dilation Spanning Tree is NP-hard ∗ Otfried Cheong 1 Herman Haverkort 2 Mira…
Cited by 5 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB