Stack-number is not bounded by queue-number

11/09/2020

∙

We describe a family of graphs with queue-number at most 4 but unbounded stack-number. This resolves open problems of Heath, Leighton and Rosenberg (1992) and Blankenship and Oporowski (1999).

READ FULL TEXT

Stack-number is not bounded by queue-number

Stack number and queue number of graphs

Stack and Queue Numbers of Graphs Revisited

Three-dimensional graph products with unbounded stack-number

A Neat Linked Queue with the Rear Sentinel

Erlang Redux: An Ansatz Method for Solving the M/M/m Queue

Queue Layouts of Graphs with Bounded Degree and Bounded Genus

Why should we add early exits to neural networks?

Stack-number is not bounded by queue-number

Related Research

Stack number and queue number of graphs

Stack and Queue Numbers of Graphs Revisited

Three-dimensional graph products with unbounded stack-number

A Neat Linked Queue with the Rear Sentinel

Erlang Redux: An Ansatz Method for Solving the M/M/m Queue

Queue Layouts of Graphs with Bounded Degree and Bounded Genus

Why should we add early exits to neural networks?