"The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard."

Peter Eades, Sue Whitesides (1994)

> Home

Details and statistics

DOI: 10.1145/177424.177507

access: closed

type: Conference or Workshop Paper

metadata version: 2021-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compgeom/EadesW94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/EadesW94
Peter Eades, Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. SCG 1994: 49-56

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.