Pages that link to "Item:Q1051655"

The following pages link to Disjoint paths in a rectilinear grid (Q1051655):

Displaying 16 items.

• 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)
• Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
• Edge-disjoint paths in planar graphs (Q1069956) (← links)
• Algorithms for routing in planar graphs (Q1075054) (← links)
• Channel routing in knock-knee mode: Simplified algorithms and proofs (Q1091149) (← links)
• An efficient parallel logarithmic time algorithm for the channel routing problem (Q1201820) (← links)
• Parity conditions in homotopic knock-knee routing (Q1207328) (← links)
• On local routing of two-terminal nets (Q1210582) (← links)
• Routings for involutions of a hypercube (Q1315464) (← links)
• Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070) (← links)
• Optimizing area for three-layer knock-knee channel routing (Q1913703) (← links)
• Bounds for the symmetric 2-peripatetic salesman problem (Q4327897) (← links)
• Some polynomially solvable subcases of the detailed routing problem in VLSI design (Q5954248) (← links)
• Finding edge-disjoint paths in partial k-trees (Q6487440) (← links)