Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
On the thickness of graphs of given degree
Information Sciences: an International Journal
Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
SIAM Journal on Discrete Mathematics
Level Planarity Testing in Linear Time
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Computing upward topological book embeddings of upward planar digraphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Constrained simultaneous and near-simultaneous embeddings
GD'07 Proceedings of the 15th international conference on Graph drawing
Drawing colored graphs on colored points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On ρ-constrained upward topological book embeddings
GD'09 Proceedings of the 17th international conference on Graph Drawing
The hamiltonian augmentation problem and its applications to graph drawing
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Upward point set embeddability for convex point sets is in P
GD'11 Proceedings of the 19th international conference on Graph Drawing
On upward point set embeddability
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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.