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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Giordano, F., Liotta, G., & Whitesides, S. H. (2009). Embeddability problems for upward planar digraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 242–253). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
