Data Structures and their Planar Graph Layouts
From MaRDI portal
Publication:4637665
DOI10.7155/jgaa.00465zbMath1386.68037OpenAlexW2794488359WikidataQ130064010 ScholiaQ130064010MaRDI QIDQ4637665
Wolfgang Brunner, Christopher Auer, Andreas Gleißner, Christian Bachmaier, Franz-Josef Brandenburg
Publication date: 25 April 2018
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00465
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (3)
Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Deque automata, languages, and planar graph representations ⋮ The Rique-number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upward planar drawings on the standing and the rolling cylinders
- Trémaux trees and planarity
- Crossing minimization in extended level drawings of graphs
- Embedding planar graphs in four pages
- The book thickness of a graph
- A characterization of level planar graphs
- Characterizing Planarity by the Splittable Deque
- Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
- Plane Drawings of Queue and Deque Graphs
- Characterizations of Deque and Queue Graphs
- Graph Algorithms
- Classification of Planar Upward Embedding
- Hierarchies and planarity theory
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Efficient Planarity Testing
- Level Planar Embedding in Linear Time
- Graph Drawing
- On the Queue Number of Planar Graphs
- How to Draw a Graph
- Graph Drawing
- Digraph embedding
This page was built for publication: Data Structures and their Planar Graph Layouts