scientific article; zbMATH DE number 4039320

MaRDI QIDQ3777475zbMATH OpenFDO

Authors Michael Kaufmann, K. Mehlhorn

Publication date 1987

zbMATH Keywords

edge-disjointlocal routingrectangular gridrouting region

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On local routing of two-terminal nets
• Algorithms for routing in planar graphs
• Routing through a generalized switchbox
• scientific article; zbMATH DE number 3932954
• Routing in polygons without rectilinearly visible corners

Cited in

(15)

• Algorithms for routing in planar graphs
• Edge-disjoint homotopic paths in a planar graph with one hole
• Routing in polygons without rectilinearly visible corners
• On local routing of two-terminal nets
• Call routing and the ratcatcher
• Local routing in a tree metric 1-spanner
• scientific article; zbMATH DE number 4191147 (Why is no real title available?)
• scientific article; zbMATH DE number 4051669 (Why is no real title available?)
• On the routability of a convex grid
• scientific article; zbMATH DE number 1762482 (Why is no real title available?)
• Brief announcement: What can(not) be perfectly rerouted locally
• Decomposition of graphs on surfaces and a homotopic circulation theorem
• Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
• Routing with critical paths
• A generic algorithm for one-dimensional homotopic compaction

This page was built for publication:

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