Results 11 to 20 of about 9,487,550 (311)
On the Queue-Number of Graphs with Bounded Tree-Width [PDF]
The Electronic Journal of Combinatorics, 2017 A queue layout of a graph consists of a linear order on the vertices and an assignment of the edges to queues, such that no two edges in a single queue are nested. The minimum number of queues needed in a queue layout of a graph is called its queue-number. We show that for each $k\geq0$, graphs with tree-width at most $k$ have queue-number at most $2^k-
Veit Wiechert
semanticscholar +6 more sources
On the Queue-Number of Partial Orders [PDF]
International Symposium Graph Drawing and Network Visualization, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Felsner, Stefan +2 more
openaire +4 more sources
Planar Graphs have Bounded Queue-Number [PDF]
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019 We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath et al. [66] from 1992. The key to the proof is a new structural tool called layered partitions , and the result that every planar graph has a vertex-partition and a layering, such that each part has a bounded number of vertices ...
Dujmović, Vida V. +5 more
openaire +11 more sources
The Local Queue Number of Graphs with Bounded Treewidth [PDF]
International Symposium Graph Drawing and Network Visualization, 2020 Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)
Merker, Laura, Ueckerdt, Torsten
openaire +6 more sources
On the queue-number of the hypercube
Electronic Notes in Discrete Mathematics, 2011 Abstract A queue layout of a graph consists of a linear ordering σ of its vertices, and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to σ . A queue-number of G is the minimal number of queues in a queue layout of G .
Riste Škrekovski +2 more
openaire +3 more sources
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg [PDF]
Comment: The presented decomposition technique (Theorems 1.2/1.3) has been already independently shown by T. Ueckerdt, D.R. Wood, W. Yi (https://doi.org/10.37236/10614); a circumstance that I missed due to the result not being advertised in the corresponding abstract. Moreover, Lemma 4.2 is wrong, thus new technical details are necessary.
Henry Förster
openaire +3 more sources
Planar Graphs of Bounded Degree have Constant Queue Number
, 2018 A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the minimum number of queues required by any of its queue layouts.
Bekos, Michael A. +6 more
openaire +4 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +3 more sources
An Analysis of the “Horizontal Y” Shaped Queuing Model to Assist in Health Care Institution [PDF]
International Journal Bioautomation, 2023 The “Horizontal Y” shaped queuing model in which there is bulk infinite arrival of patients, but available M services are limited. The discrete flow of patients in the system is reduced in continuous flow and a diffusion equation is used.
Manish Kumar Pandey +1 more
doaj +1 more source
A Time-Sharing Queue with a Finite Number of Customers [PDF]
JACM, 1969 I. Adiri, Benjamin Avi-Itzhak
openalex +2 more sources