Pages that link to "Item:Q1069956"

The following pages link to Edge-disjoint paths in planar graphs (Q1069956):

Displaying 50 items.

• Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
• Upgrading edge-disjoint paths in a ring (Q429680) (← links)
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (Q650915) (← links)
• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
• The hardness of routing two pairs on one face (Q662307) (← links)
• Ideal clutters (Q697573) (← links)
• Packing paths in planar graphs (Q809091) (← links)
• The shortest multipaths problem in a capacitated dense channel (Q859708) (← links)
• Edge-disjoint paths in a grid bounded by two nested rectangles (Q913521) (← links)
• Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
• Induced disjoint paths problem in a planar digraph (Q967379) (← links)
• Disjoint paths in sparse graphs (Q967419) (← links)
• A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
• Algorithms for routing in planar graphs (Q1075054) (← links)
• Edge-disjoint homotopic paths in a planar graph with one hole (Q1097900) (← links)
• On obstructions to small face covers in planar graphs (Q1204479) (← links)
• Algorithms for routing around a rectangle (Q1208452) (← links)
• Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
• Sonet ring sizing with genetic algorithms (Q1362967) (← links)
• Reconstructing edge-disjoint paths. (Q1413914) (← links)
• Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
• Length-bounded disjoint paths in planar graphs (Q1613380) (← links)
• A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
• A note on packing paths in planar graphs (Q1906072) (← links)
• On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary (Q2149491) (← links)
• On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)
• On finding Min-Min disjoint paths (Q2375950) (← links)
• Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem (Q2466024) (← links)
• An algorithm for node-capacitated ring routing (Q2467482) (← links)
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
• A note on the ring loading problem (Q2790401) (← links)
• Routing in undirected graphs with constant congestion (Q2817791) (← links)
• Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time (Q3128989) (← links)
• A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes (Q3194707) (← links)
• Finding k Partially Disjoint Paths in a Directed Planar Graph (Q3295274) (← links)
• Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs (Q3351373) (← links)
• Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
• (Q3615433) (← links)
• Disjoint Paths in a Planar Graph—A General Theorem (Q3989016) (← links)
• Disjoint Paths in the Plane (Q4835451) (← links)
• (Q4918454) (← links)
• (Q4952693) (← links)
• An Improved Upper Bound for the Ring Loading Problem (Q5071092) (← links)
• Shortest edge-disjoint paths in graphs (Q5096182) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• Edge Disjoint Paths in Moderately Connected Graphs (Q5893911) (← links)
• Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
• Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring (Q5936466) (← links)
• The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)