Pages that link to "Item:Q1959418"

The following pages link to 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):

Displaying 2 items.

• A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914) (← links)
• On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)