The following pages link to STACS 2004 (Q5309713):
Displaying 18 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- A simple solution to the two paths problem in planar graphs (Q917331) (← links)
- Reconstructing edge-disjoint paths faster (Q1785736) (← links)
- Bidirectional edges problem. I: A simple algorithm (Q1908265) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- A fast algorithm for the path 2-packing problem (Q2268342) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Two disjoint shortest paths problem with non-negative edge length (Q2294269) (← links)
- The undirected two disjoint shortest paths problem (Q2294271) (← links)
- Solving the 2-disjoint paths problem in nearly linear time (Q2432525) (← links)
- Computing Resolution-Path Dependencies in Linear Time , (Q2843322) (← links)
- (Q3326860) (← links)
- A quick method for finding shortest pairs of disjoint paths (Q3330991) (← links)
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem (Q3599102) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- A linear algorithms for the two paths problem on permutation graphs (Q4882588) (← links)
- LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS (Q4886310) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5244398) (← links)