The following pages link to Homotopic routing methods (Q3360021):
Displaying 22 items.
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Routing with critical paths (Q910228) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- Algorithms for routing in planar graphs (Q1075054) (← links)
- Graph minors. VI. Disjoint paths across a disc (Q1079580) (← links)
- Finding a homotopy base for directed paths in an acyclic graph (Q1099184) (← links)
- Routing and timetabling by topological search (Q1126868) (← links)
- Disjoint homotopic paths and trees in a planar graph (Q1179127) (← links)
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges (Q1693321) (← links)
- Optimum path packing on wheels: The consecutive case (Q1921239) (← links)
- Face-width of embedded graphs (Q2702745) (← links)
- Routing algorithms under mutual interference constraints (Q2793581) (← links)
- Simultaneous disjoint routing in regular graphs (Q2816081) (← links)
- A mixed integer model for the sparsest cut problem (Q2883559) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs (Q3351373) (← links)
- Homotopic Rectilinear Routing with Few Links and Thick Edges (Q3557041) (← links)
- Routing algorithms in honeycomb meshes (Q3645052) (← links)
- (Q3813339) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
