The following pages link to A matter of degree (Q3192023):
Displayed 3 items.
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)