Characterizations of deque and queue graphs

DOI10.1007/978-3-642-25870-1_5zbMATH Open1341.05036OpenAlexW2227355058MaRDI QIDQ3104763FDOQ3104763

Authors: 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

Recommendations

• Data Structures and their Planar Graph Layouts
• Plane Drawings of Queue and Deque Graphs
• Laying Out Graphs Using Queues
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Characterizing planarity by the splittable deque

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• The book thickness of a graph
• Laying Out Graphs Using Queues
• Embedding planar graphs in four pages
• Title not available (Why is that?)
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Plane Drawings of Queue and Deque Graphs
• Hierarchies and planarity theory
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Stacks, queues and tracks: layouts of graph subdivisions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Finding geometric representations of apex graphs is NP-hard
• Deque languages, automata and planar graphs
• Linear layouts of bipartite planar graphs
• Data Structures and their Planar Graph Layouts
• Plane Drawings of Queue and Deque Graphs
• Recognizing geometric intersection graphs stabbed by a line
• Characterizing planarity by the splittable deque
• Finding geometric representations of apex graphs is \textsf{NP}-hard
• Deque automata, languages, and planar graph representations
• Upward planar drawings on the standing and the rolling cylinders

This page was built for publication: Characterizations of deque and queue graphs

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