Article,

Computing Geometric Minimum-Dilation Graphs is NP-Hard.

, , , , and .
Int. J. Comput. Geom. Appl., 20 (2): 147-173 (2010)

Meta data

Tags

Users

  • @dblp

Comments and Reviews