The Local Queue Number of Graphs with Bounded Treewidth

DOI10.1007/978-3-030-68766-3_3OpenAlexW3134892487MaRDI QIDQ5014102

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

zbMATH Keywords

treewidthqueue numberlocal covering number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Linear layouts of complete graphs ⋮ Linear layouts of bipartite planar graphs ⋮ On mixed linear layouts of series-parallel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the queue-number of graphs with bounded tree-width
• On the page number of RNA secondary structures with pseudoknots
• Three ways to cover a graph
• Multilayer grid embeddings for VLSI
• Bipartite dimensions and bipartite degrees of graphs
• The book thickness of a graph
• The thickness of graphs: A survey
• Processor-efficient sparse matrix-vector multiplication
• Local and union page numbers
• Caterpillar arboricity of planar graphs
• Covering and packing in graphs IV: Linear arboricity
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
• Planar Graphs Have Bounded Queue-Number
• Layout of Graphs with Bounded Tree-Width
• Decomposition of Finite Graphs Into Forests
• Edge intersection graphs of linear 3-uniform hypergraphs
• Queue layouts of planar 3-trees
• Stack and queue number of 2-trees

This page was built for publication: The Local Queue Number of Graphs with Bounded Treewidth