"Computing Geometric Minimum-Dilation Graphs is NP-Hard."

Panos Giannopoulos et al. (2010)

> Home

Details and statistics

DOI: 10.1142/S0218195910003244

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcga/GiannopoulosKKKM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcga/GiannopoulosKKKM10
Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx:
Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. 20(2): 147-173 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.