Pages that link to "Item:Q1762944"
From MaRDI portal
The following pages link to Euclidean bounded-degree spanning tree ratios (Q1762944):
Displaying 13 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST (Q832851) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Bounded-angle minimum spanning trees (Q2072102) (← links)
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST (Q2088886) (← links)
- On improved bounds for bounded degree spanning trees for points in arbitrary dimension (Q2250052) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- The complexity of symmetric connectivity in directional wireless sensor networks (Q2307492) (← links)
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios (Q5146820) (← links)
