Stack-Number is Not Bounded by Queue-Number

2021/08/31 by Vida Dujmović, David Eppstein, Robert Hickingbotham +2 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computer network #Computer science #Discrete mathematics #Limits and Structures in Graph Theory #Mathematics #Operating system #Parallel computing #Queue #Stack (abstract data type)

paper · doi:10.1007/s00493-021-4585-7

crossref issued 2021/08/31 · crossref published 2021/08/31 · crossref published-online 2021/08/31 · openalex publication_date 2021/08/31 · crossref created 2021/08/31 · crossref published-print 2022/04/01 · crossref deposited 2022/05/21 · openalex created_date 2025/10/10 · crossref indexed 2026/01/02 · openalex updated_date 2026/08/05

Citations

• A Combinatorial Problem in Geometry
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Graphs with E Edges Have Pagenumber O(√E)
• Laying Out Graphs Using Queues
• The book thickness of a graph
• On 3-pushdown graphs with large separators
• Layout of Graphs with Bounded Tree-Width
• Planar graphs have bounded queue-number
• Sparsity

Cited by

• Book embedding [wikipedia]