Pages that link to "Item:Q486998"
From MaRDI portal
The following pages link to Degree constrained node-connectivity problems (Q486998):
Displaying 7 items.
- On some network design problems with degree constraints (Q355516) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- The connected critical node problem (Q2672625) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Network Design with Edge-Connectivity and Degree Constraints (Q5443519) (← links)