Recognizing outerplanar graphs in linear time
International Workshop WG '86 on Graph-theoretic concepts in computer science
Embedding graphs in books: a layout problem with applications to VLSI design
SIAM Journal on Algebraic and Discrete Methods
Embedding planar graphs in four pages
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Comparing queues and stacks as mechanisms for laying out graphs
SIAM Journal on Discrete Mathematics
Laying out graphs using queues
SIAM Journal on Computing
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Journal of Discrete Algorithms
Characterizations of deque and queue graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Classification of planar upward embedding
GD'11 Proceedings of the 19th international conference on Graph Drawing
Testing planarity by switching trains
GD'12 Proceedings of the 20th international conference on Graph Drawing
Upward planar drawings on the standing and the rolling cylinders
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In stack and queue layouts the vertices of a graph are linearly ordered from left to right, where each edge corresponds to an item and the left and right end vertex of each edge represents the addition and removal of the item to the used data structure. A graph admitting a stack or queue layout is a stack or queue graph, respectively. Typical stack and queue layouts are rainbows and twists visualizing the LIFO and FIFO principles, respectively. However, in such visualizations, twists cause many crossings, which make the drawings incomprehensible. We introduce linear cylindric layouts as a visualization technique for queue and deque (double-ended queue) graphs. It provides new insights into the characteristics of these fundamental data structures and extends to the visualization of mixed layouts with stacks and queues. Our main result states that a graph is a deque graph if and only if it has a plane linear cylindric drawing.