The following pages link to A matter of degree (Q3192023):
Displaying 7 items.
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- The Evolution of the Minimum Degree Ordering Algorithm (Q3823722) (← links)
- MaxMin allocation via degree lower-bounded arborescences (Q5172749) (← links)