Pages that link to "Item:Q429668"

The following pages link to On shortest disjoint paths in planar graphs (Q429668):

Displaying 41 items.

• Planar disjoint-paths completion (Q329285) (← links)
• Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
• Finding paths with minimum shared edges (Q386426) (← links)
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
• Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
• Induced disjoint paths problem in a planar digraph (Q967379) (← links)
• Output-sensitive reporting of disjoint paths (Q1283681) (← links)
• A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
• The disjoint shortest paths problem (Q1392552) (← links)
• Length-bounded disjoint paths in planar graphs (Q1613380) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• On the edge capacitated Steiner tree problem (Q2218647) (← links)
• The undirected two disjoint shortest paths problem (Q2294271) (← links)
• On the computational complexity of closest genome problems (Q2295622) (← links)
• The directed 2-linkage problem with length constraints (Q2304550) (← links)
• Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
• On finding Min-Min disjoint paths (Q2375950) (← links)
• Short disjoint paths in locally connected graphs (Q2464055) (← links)
• On the connectivity preserving minimum cut problem (Q2637652) (← links)
• Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786) (← links)
• Paths of low weight in planar graphs (Q3527531) (← links)
• (Q3834075) (← links)
• Disjoint Paths in a Planar Graph—A General Theorem (Q3989016) (← links)
• The Vertex-Disjoint Menger Problem in Planar Graphs (Q4337639) (← links)
• (Q4607877) (← links)
• (Q4910718) (← links)
• (Q5090955) (← links)
• (Q5091009) (← links)
• Shortest edge-disjoint paths in graphs (Q5096182) (← links)
• The Directed Disjoint Shortest Paths Problem (Q5111698) (← links)
• Shortest Two Disjoint Paths in Polynomial Time (Q5244398) (← links)
• Improved approximation for node-disjoint paths in planar graphs (Q5361861) (← links)
• Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
• Inserting an edge into a geometric embedding (Q5915946) (← links)
• Inserting an edge into a geometric embedding (Q5918441) (← links)
• On the approximability of time disjoint walks (Q5918517) (← links)
• Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
• On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
• Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths (Q6171262) (← links)
• An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization (Q6173784) (← links)
• The non-stop disjoint trajectories problem (Q6564192) (← links)