Algorithms for routing in planar graphs

DOI10.1007/BF00289496zbMath0591.68065MaRDI QIDQ1075054

B. George

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

pairwise edge-disjoint paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Channel routing in knock-knee mode: Simplified algorithms and proofs ⋮ Quantum routing in planar graph using perfect state transfer ⋮ Edge-disjoint paths in a grid bounded by two nested rectangles ⋮ Parity conditions in homotopic knock-knee routing ⋮ On local routing of two-terminal nets ⋮ A linear-time algorithm for edge-disjoint paths in planar graphs ⋮ A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works

Cites Work

• Unnamed Item
• Disjoint paths in a rectilinear grid
• Edge-disjoint paths in planar graphs
• Multicommodity flows in planar graphs
• On multicommodity flows in planar graphs
• Optimal Three-Layer Channel Routing

This page was built for publication: Algorithms for routing in planar graphs