Pages that link to "Item:Q5370716"
From MaRDI portal
The following pages link to The Euclidean degree-4 minimum spanning tree problem is NP-hard (Q5370716):
Displayed 5 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)