"The Euclidean degree-4 minimum spanning tree problem is NP-hard."

Andrea Francke, Michael Hoffmann (2009)

> Home

Details and statistics

DOI: 10.1145/1542362.1542399

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compgeom/FranckeH09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/FranckeH09
Andrea Francke, Michael Hoffmann:
The Euclidean degree-4 minimum spanning tree problem is NP-hard. SCG 2009: 179-188

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.