Characterizations of Deque and Queue Graphs

DOI10.1007/978-3-642-25870-1_5zbMath1341.05036OpenAlexW2227355058MaRDI QIDQ3104763

Christopher Auer, Andreas Gleißner

Publication date: 16 December 2011

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Finding geometric representations of apex graphs is NP-hard ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ Linear layouts of bipartite planar graphs ⋮ Recognizing geometric intersection graphs stabbed by a line ⋮ Data Structures and their Planar Graph Layouts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding planar graphs in four pages
• The book thickness of a graph
• Plane Drawings of Queue and Deque Graphs
• Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
• Hierarchies and planarity theory
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

This page was built for publication: Characterizations of Deque and Queue Graphs