Searching for "Computing Geometric Minimum-Dilation Graphs 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 geometric minimum-dilation graphs is NP-hard
by Rolf Klein, Martin Kutz — 2006 — In Proc. of Graph Drawing
…Computing Geometric Minimum-Dilation Graphs is NP-Hard Rolf Klein ⋆1 and Martin Kutz 2 1 Institute…
Cited by 4 (0 self) – Add To MetaCart

Showing 1 through 1.

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