Linear layouts of graphs with priority queues

DOI10.4230/LIPICS.WADS.2025.29MaRDI QIDQ7312578zbMATH OpenFDO

Authors Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.WADS.2025.29

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• A partial k-arboretum of graphs with bounded treewidth
• An improved upper bound on the queue number of planar graphs
• Bounded-degree graphs have arbitrarily large queue-number
• Characterizations of deque and queue graphs
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Computing straight-line 3D grid drawings of graphs in linear volume
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding planar graphs in four pages
• Four pages are indeed necessary for planar graphs
• Graph layouts via layered separators
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XX: Wagner's conjecture
• scientific article; zbMATH DE number 15256 (Why is no real title available?)
• scientific article; zbMATH DE number 4128415 (Why is no real title available?)
• scientific article; zbMATH DE number 2159655 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Laying Out Graphs Using Queues
• Layout of Graphs with Bounded Tree-Width
• Linear layouts of bipartite planar graphs
• Mixed linear layouts of planar graphs
• Mixed linear layouts: complexity, heuristics, and experiments
• On mixed linear layouts of series-parallel graphs
• On the Queue Number of Planar Graphs
• Planar graphs have bounded queue-number
• Planar graphs of bounded degree have bounded queue number
• Planar graphs that need four pages
• Plane Drawings of Queue and Deque Graphs
• Queue layouts of planar 3-trees
• RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
• Schematic representation of large biconnected graphs
• The book thickness of a graph
• The Complexity of Coloring Circular Arcs and Chords
• The mixed page number of graphs
• The Rique-number of graphs
• Three-Dimensional Circuit Layouts
• Track layouts, layered path decompositions, and leveled planarity

This page was built for publication: Linear layouts of graphs with priority queues

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