Show simple item record

dc.contributor.authorHeath, Lenwood S.en_US
dc.contributor.authorPemmaraju, Sriram V.en_US
dc.date.accessioned2013-06-19T14:35:43Z
dc.date.available2013-06-19T14:35:43Z
dc.date.issued1992
dc.identifierhttp://eprints.cs.vt.edu/archive/00000311/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19732
dc.description.abstractThe 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleStack and Queue Layouts of Posetsen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-92-31en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000311/01/TR-92-31.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record