Embeddability Problems for Upward Planar Digraphs

Giordano, Francesco and Liotta, Giuseppe and Whitesides, Sue (2009) Embeddability Problems for Upward Planar Digraphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 242-253(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_23).

Full text not available from this repository.

Abstract

We study two embedding problems for upward planar digraphs. Both problems arise in the context of drawing sequences of upward planar digraphs having the same set of vertices, where the location of each vertex is to remain the same for all the drawings of the graphs. We develop a method, based on the notion of book embedding, that gives characterization results for embeddability as well as testing and drawing algorithms.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-00219-9_23
Classifications: P Styles > P.840 Upward
G Algorithms and Complexity > G.490 Embeddings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/910

Actions (login required)

View Item View Item