Pages that link to "Item:Q4651931"
From MaRDI portal
The following pages link to Approximation algorithms for finding low-degree subgraphs (Q4651931):
Displayed 6 items.
- On some network design problems with degree constraints (Q355516) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- Edge ranking and searching in partial orders (Q955315) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- Network-Design with Degree Constraints (Q3088102) (← links)