Stack and Queue Layouts of Posets
From MaRDI portal
Publication:4377447
DOI10.1137/S0895480193252380zbMath0884.05086OpenAlexW2078050303MaRDI QIDQ4377447
Lenwood S. Heath, Sriram V. Pemmaraju
Publication date: 9 February 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480193252380
Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)
Related Items (21)
On the queue-number of partial orders ⋮ On the Page Number of Upward Planar Directed Acyclic Graphs ⋮ A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Queue layouts of two-dimensional posets ⋮ Lazy queue layouts of posets ⋮ Upward Partitioned Book Embeddings ⋮ The queue-number of posets of bounded width or height ⋮ Graph layouts via layered separators ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ A new upper bound on the queuenumber of hypercubes ⋮ Processor-efficient sparse matrix-vector multiplication ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes ⋮ Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Volume requirements of 3D upward drawings ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Upward Book Embeddings of st-Graphs ⋮ Lazy Queue Layouts of Posets
This page was built for publication: Stack and Queue Layouts of Posets
