Pages that link to "Item:Q1028423"
From MaRDI portal
The following pages link to Degree-bounded minimum spanning trees (Q1028423):
Displaying 27 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← 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)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- Degree-preserving spanning trees in small-degree graphs (Q1579547) (← links)
- The vertex degrees of minimum spanning trees (Q1580975) (← links)
- Approximation schemes for degree-restricted MST and red-blue separation problems (Q1762989) (← links)
- Near-optimal bounded-degree spanning trees (Q1840509) (← 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)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
- Minimum Spanning Trees in <i>k</i>-Dimensional Space (Q3798263) (← links)
- Approximation schemes for degree-restricted MST and red-blue separation problem (Q4449174) (← links)
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios (Q5146820) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
- Rooted Uniform Monotone Minimum Spanning Trees (Q5283385) (← links)
- The Euclidean degree-4 minimum spanning tree problem is NP-hard (Q5370716) (← links)
- The expected degree of minimal spanning forests (Q5915869) (← links)
