Pages that link to "Item:Q3569819"
From MaRDI portal
The following pages link to Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems (Q3569819):
Displaying 4 items.
- Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
