The Local Queue Number of Graphs with Bounded Treewidth
From MaRDI portal
Publication:5014102
DOI10.1007/978-3-030-68766-3_3OpenAlexW3134892487MaRDI QIDQ5014102FDOQ5014102
Authors: Laura Merker, Torsten Ueckerdt 
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.05392
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Decomposition of Finite Graphs Into Forests
- The book thickness of a graph
- Laying Out Graphs Using Queues
- Layout of Graphs with Bounded Tree-Width
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- Bipartite dimensions and bipartite degrees of graphs
- Covering and packing in graphs IV: Linear arboricity
- The thickness of graphs: A survey
- Caterpillar arboricity of planar graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Three ways to cover a graph
- On the page number of RNA secondary structures with pseudoknots
- Edge intersection graphs of linear 3-uniform hypergraphs
- Title not available (Why is that?)
- On the queue-number of graphs with bounded tree-width
- Processor-efficient sparse matrix-vector multiplication
- Title not available (Why is that?)
- Multilayer grid embeddings for VLSI
- Planar Graphs Have Bounded Queue-Number
- Local and union page numbers
- Queue layouts of planar 3-trees
- Stack and queue number of 2-trees
Cited In (5)
This page was built for publication: The Local Queue Number of Graphs with Bounded Treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014102)
