Wiring Edge-Disjoint Layouts

Kuchem, Ruth and Wagner, Dorothea (1997) Wiring Edge-Disjoint Layouts. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 271-285(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_54).

Full text not available from this repository.

Abstract

We 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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_54
Classifications: G Algorithms and Complexity > G.999 Others
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/149

Actions (login required)

View Item View Item