A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A queue layout of a graph G consists of a vertex ordering of G and a partition of the edges into so-called queues such that no two edges in the same queue nest, i.e., have their endpoints ordered in an ABBA-pattern. Continuing the research on local ordered covering numbers, we introduce the local queue number of a graph G as the minimum ℓ such that G admits a queue layout with each vertex having incident edges in no more than ℓ queues. Similarly to the local page number [Merker, Ueckerdt,arXiv:2008.05392v1 fatcat:my4zz5s5dvau3a3ifbbao5xfwm