Algorithms for routing in planar graphs

DOI10.1007/BF00289496MaRDI QIDQ1075054zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4039320
• scientific article; zbMATH DE number 4211829
• Routing through a generalized switchbox
• Publication:4860304
• Routing in polygons without rectilinearly visible corners

Cites work

• scientific article; zbMATH DE number 3932954 (Why is no real title available?)
• 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

Cited in

(13)

• A simple routing algorithm based on Schnyder coordinates
• Channel routing in knock-knee mode: Simplified algorithms and proofs
• Quantum routing in planar graph using perfect state transfer
• scientific article; zbMATH DE number 4039320 (Why is no real title available?)
• Algorithms for 1-Planar Graphs
• Algorithms for routing around a rectangle
• Routing with critical paths
• Edge-disjoint paths in a grid bounded by two nested rectangles
• 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
• Parity conditions in homotopic knock-knee routing
• Routing in polygons without rectilinearly visible corners
• On local routing of two-terminal nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075054)