Characterizing planarity by the splittable deque

DOI10.1007/978-3-319-03841-4_3MaRDI QIDQ2867640zbMATH OpenOpenAlexFDO

Authors Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Franz J. Brandenburg

Publication date 20 December 2013

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03841-4_3

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Characterizations of deque and queue graphs
• Data Structures and their Planar Graph Layouts
• Plane Drawings of Queue and Deque Graphs
• Laying Out Graphs Using Queues
• Queue layouts of planar 3-trees

Cited in

(2)

• Data Structures and their Planar Graph Layouts
• Characterizations of deque and queue graphs

This page was built for publication: Characterizing planarity by the splittable deque

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867640)