Algorithms for routing in planar graphs
From MaRDI portal
Recommendations
Cites work
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)