Embeddability Problems for Upward Planar Digraphs
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.
KeywordsSpan Subgraph External Face Satisfying Property Embeddability Problem Planar Embedding
- 7.Giordano, F., Liotta, G., Whitesides, S.: Drawing a sequence of upward planar digraphs: Characterization results and testing algorithms. Tech. rep., Università degli Studi di Perugia, RT-008-01 (2008)Google Scholar