Pages that link to "Item:Q1188767"

The following pages link to Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany (Q1188767):

Displayed 8 items.

• The shortest multipaths problem in a capacitated dense channel (Q859708) ‎ (← links)
• Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) ‎ (← links)
• Multiflow Feasibility: An Annotated Tableau (Q2971612) ‎ (← links)
• Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) ‎ (← links)
• On the approximability of time disjoint walks (Q5918517) ‎ (← links)
• Walking through waypoints (Q5918830) ‎ (← links)
• On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) ‎ (← links)
• Approximating maximum integral multiflows on bounded genus graphs (Q6142346) ‎ (← links)