Results 11 to 20 of about 9,663,355 (323)
An Improved Upper Bound on the Queue Number of Planar Graphs
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
openaire +3 more sources
The Local Queue Number of Graphs with Bounded Treewidth [PDF]
Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)
Merker, Laura, Ueckerdt, Torsten
openaire +5 more sources
Endogenous queue number determination in G/M/s systems [PDF]
AbstractThis paper presents a model for the endogenous determination of the number of queues in a G/M/s system. Customers arriving at a system where s customers are being served play a game, choosing between s parallel queues or one single queue. Equilibria are obtained for risk-neutral and risk-averse customers.
Vasco F. Alves
openalex +2 more sources
Graphs with queue number three and unbounded stack number [PDF]
31 pages, 7 ...
Yui Hin Arvin Leung
openalex +3 more sources
Track Drawings of Graphs with Constant Queue Number [PDF]
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.
openaire +4 more sources
On the queue-number of the hypercube
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 .
Petr Gregor +2 more
openaire +2 more sources
Planar Graphs of Bounded Degree have Constant Queue Number [PDF]
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.
Michael A. Bekos +6 more
openalex +3 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
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
RANCANG BANGUN SISTEM NOMER ANTRIAN BERBASIS INTERNET OF THINGS (IOT)
Queuing is a phenomenon that we can encounter anywhere and anytime, such as queuing to get food orders, ticketing services, and so on. However, unfortunately not everyone likes to queue, especially queuing for public agency services.
I Made Agus Chandra Wijaya +1 more
doaj +1 more source
An Analysis of the “Horizontal Y” Shaped Queuing Model to Assist in Health Care Institution [PDF]
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

