Algorithms for routing in planar graphs

Abstract

We present algorithms for solving routing problems for two-terminal nets in planar graphs. Our algorithms run in time O(n2) for general planar graphs and in time O(bn) for grid graphs where n is the number of vertices and b is the number of vertices on the boundary of the infinite face