Pages that link to "Item:Q1613380"
From MaRDI portal
The following pages link to Length-bounded disjoint paths in planar graphs (Q1613380):
Displaying 16 items.
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← 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)
- The directed 2-linkage problem with length constraints (Q2304550) (← links)
- On finding Min-Min disjoint paths (Q2375950) (← links)
- Short disjoint paths in locally connected graphs (Q2464055) (← links)
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)
- Wide diameter and minimum length of disjoint Menger path systems (Q3367054) (← links)
- Disjoint Paths in a Planar Graph—A General Theorem (Q3989016) (← links)
- (Q4910718) (← links)
- (Q5090955) (← links)
- LATIN 2004: Theoretical Informatics (Q5901632) (← links)
- Maximum thick paths in static and dynamic environments (Q5902231) (← links)
- Algorithms on a path covering problem with applications in transportation (Q6606160) (← links)
