Bitonic st-orderings of Biconnected Planar GraphsGronemann, 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.
Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_14
AbstractVertex 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.
Actions (login required)
|