Computer Science Technical Reports
CS at VT

Stack and Queue Layouts of Posets

Heath, Lenwood S. and Pemmaraju, Sriram V. (1992) Stack and Queue Layouts of Posets. Technical Report TR-92-31, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-92-31.pdf (906224)


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 is shown for the queuenumber of the class of planar posets. The queuenumber of a planar poset is shown to be within a small constant factor of its width. The stacknumber of posets with planar covering graphs is shown to be . 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.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:311
Deposited By:User autouser
Deposited On:05 December 2001