Bitonic st-orderings of Biconnected Planar Graphs

Gronemann, Martin (2014) Bitonic st-orderings of Biconnected Planar Graphs. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 162-173(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_14).

Full text not available from this repository.

Abstract

Vertex orderings play an important role in the design of graph drawing algorithms. Compared to canonical orderings, st-orderings lack a certain property that is required by many drawing methods. In this paper, we propose a new type of st-ordering for biconnected planar graphs that relates the ordering to the embedding. We describe a linear-time algorithm to obtain such an ordering and demonstrate its capabilities with two applications.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-662-45803-7_14
Classifications: G Algorithms and Complexity > G.280 Canonical Ordering
G Algorithms and Complexity > G.630 Labeling
P Styles > P.540 Planar
P Styles > P.780 Symmetric
P Styles > P.900 Visibility
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 22 May 2015 09:02
Last Modified: 22 May 2015 09:02
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1430

Actions (login required)

View Item View Item