Pages that link to "Item:Q2380008"
From MaRDI portal
The following pages link to Spanning trees with minimum weighted degrees (Q2380008):
Displaying 13 items.
- Network design with weighted degree constraints (Q429670) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- Minimum spanning trees in networks with varying edge weights (Q863566) (← links)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- The vertex degrees of minimum spanning trees (Q1580975) (← links)
- Primal dual based algorithm for degree-balanced spanning tree problem (Q1740242) (← links)
- Low degree spanning trees of small weight (Q2817632) (← links)
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs (Q3057180) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- (Q4437490) (← links)
- Minimum Spanning Tree with Neighborhoods (Q5434449) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)