A survey of graph layout problems
ACM Computing Surveys (CSUR)
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Upper bounds on the queuenumber of k-ary n-cubes
Information Processing Letters
Processor-efficient sparse matrix-vector multiplication
Computers & Mathematics with Applications
Computing upward topological book embeddings of upward planar digraphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Volume requirements of 3d upward drawings
GD'05 Proceedings of the 13th international conference on Graph Drawing
Characterisations and examples of graph classes with bounded expansion
European Journal of Combinatorics
On the page number of upward planar directed acyclic graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and the queuenumber of its covering graph. A lower bound of $\Omega(\sqrt n)$ is shown for the queuenumber of the class of n-element planar posets. The queuenumber of a planar poset is shown to be within a small constant factor of its width. The stacknumber of n-element posets with planar covering graphs is shown to be $\Theta(n)$. These results exhibit sharp differences between the stacknumber and queuenumber of posets as well as between the stacknumber (queuenumber) of a poset and the stacknumber (queuenumber) of its covering graph.