Single row routing with bounded number of doglegs per net

Sufficient and necessary conditions are presented for single-row routing when the number of doglegs per net is bounded by K, K=1, 2. Algorithms for finding such realizations are developed. The necessary and sufficient conditions are based on a graph theoretic representation, in which an instance of the single-row routing problem is represented by three graphs: an overlap graph, a containment graph, and an interval graph.<
>