Results 1 to 10 of about 9,487,550 (311)

Bounded-Degree Graphs have Arbitrarily Large Queue-Number [PDF]

open access: greenDiscrete Mathematics & Theoretical Computer Science, 2008
It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all Δ ≥ 3 and for all sufficiently large n, there is a simple Δ-regular n-vertex graph with queue-number at least c √ Δ n 1/2-1/Δ for ...
David R. Wood
doaj   +10 more sources

Stack-Number is Not Bounded by Queue-Number [PDF]

open access: greenCombinatorica, 2021
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).
David R. Wood   +4 more
core   +6 more sources

An Improved Upper Bound on the Queue Number of Planar Graphs [PDF]

open access: hybridAlgorithmica, 2022
AbstractAk-queue layout is a special type of a linear layout, in which the linear order avoids$$(k+1)$$(k+1)-rainbows, that is,$$k+1$$k+1independent edges that pairwise form a nested pair. The optimization goal is to determine thequeue numberof a graph, which is defined as the minimum value ofkfor which ak-queue layout is feasible.
Michael Bekos   +2 more
semanticscholar   +3 more sources

On the Queue Number of Planar Graphs [PDF]

open access: greenInternational Symposium Graph Drawing and Network Visualization, 2021
A k-queue layout is a special type of a linear layout, in which the linear order avoids (k+1)-rainbows, i.e., k+1 independent edges that pairwise form a nested pair. The optimization goal is to determine the queue number of a graph, i.e., the minimum value of k for which a k-queue layout is feasible. Recently, Dujmovi et al. [J.
Bekos, Michael A.   +2 more
semanticscholar   +6 more sources

On the Queue Number of Planar Graphs [PDF]

open access: green2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010
We prove that planar graphs have poly-logarithmic queue number, thus improving upon the previous polynomial upper bound. Consequently, planar graphs admit 3D straight-line crossing-free grid drawings in small volume.
Di Battista, Giuseppe   +2 more
semanticscholar   +7 more sources

Track Drawings of Graphs with Constant Queue Number [PDF]

open access: bronzeInternational Symposium Graph Drawing and Network Visualization, 2004
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track number of G. In [9] it is proved that every graph from a proper minor closed family has constant track number if and only if it has constant queue number ...
DI GIACOMO, Emilio, Meijer H.
semanticscholar   +8 more sources

The Queue-Number of Posets of Bounded Width or Height [PDF]

open access: greenInternational Symposium Graph Drawing and Network Visualization, 2018
Heath and Pemmaraju conjectured that the queue-number of a poset is bounded by its width and if the poset is planar then also by its height. We show that there are planar posets whose queue-number is larger than their height, refuting the second conjecture.
Knauer, K., Micek, P., Ueckerdt, T.
semanticscholar   +8 more sources

Track Layouts of Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2004
A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović   +2 more
doaj   +6 more sources

The number of overtakes in an M/M/2 queue

open access: goldOperations Research Perspectives, 2018
The phenomenon of overtaking in queueing systems and queueing networks has been addressed by several authors with various motivations in the last decades. Nevertheless, up to now, for the relatively simple M/M/2/FCFS queue, the distribution of the number
Hendrik Baumann, Berenice Anne Neumann
doaj   +2 more sources

Home - About - Disclaimer - Privacy