Pages that link to "Item:Q5434432"
From MaRDI portal
The following pages link to Efficient Algorithms for k-Disjoint Paths Problems on DAGs (Q5434432):
Displayed 4 items.
- A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914) (← links)
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph (Q1959418) (← links)
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
- Curvature in image and shape processing (Q4682463) (← links)