## Wiring Edge-Disjoint Layouts
Kuchem, Ruth and Wagner, Dorothea
(1997)
Full text not available from this repository. ## AbstractWe consider the wiring or layer assignment problem for edge-disjoint layouts. The wiring problem is well understood for the case that underlying layout graph is a square grid. In this paper, we introduce a more general approach to this problem. For an edge-disjoint layout in the plane resp. in an arbitrary planar layout graph, we give equivalent conditions for the k-layer wirability. Based on these conditions, we obtain linear-time algorithms to wire every layout in a tri-hexagonal grid, respectively every layout in a tri-square-hexagonal grid using at most five layers.
Repository Staff Only: item control page References |