Results 11 to 20 of about 43,475 (165)
Stack and Queue Layouts via Layered Separators [PDF]
Journal of Graph Algorithms and Applications, 2016 It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not ...
ED Demaine +15 more
core +4 more sources
Lazy Queue Layouts of Posets [PDF]
Algorithmica, 2020 AbstractWe investigate the queue number of posets in terms of their width, that is, the maximum number of pairwise incomparable elements. A long-standing conjecture of Heath and Pemmaraju asserts that every poset of width w has queue number at most w. The conjecture has been confirmed for posets of width $$w=2$$ w
Jawaherul Md. Alam +4 more
openaire +3 more sources
Parameterized Algorithms for Queue Layouts [PDF]
Journal of Graph Algorithms and Applications, 2020 An $h$-queue layout of a graph $G$ consists of a linear order of its vertices and a partition of its edges into $h$ sets, called queues, such that no two independent edges of the same queue nest. The minimum $h$ such that $G$ admits an $h$-queue layout is the queue number of $G$.
Sujoy Bhore +3 more
openaire +4 more sources
Queue Layouts of Planar 3-Trees [PDF]
Algorithmica, 2018 AbstractA queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are nested. The queue number of graph G is defined as the minimum number of queues required by any queue layout of G.
Alam, Jawaherul Md. +4 more
openaire +3 more sources
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing [PDF]
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2002 A three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in Z3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing '01, Lecture Notes in Comput.
Dujmović, Vida +2 more
+5 more sources
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
, 2005 A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg +27 more
core +3 more sources
Transport, 2023 Airlines strive to minimize the waiting time for passenger service at the airport. Modification of the passenger service process at check-in stands can be carried out by modelling and then simulating various scenarios in order to obtain time benefits ...
Izabela Kalbarczyk +2 more
doaj +1 more source
Impact of Queue Configuration on Service Time: Evidence from a Supermarket [PDF]
, 2017 We study how queue configuration affects human servers’ service time by comparing dedicated queues with shared queues using field data from a natural experiment in a supermarket.
Wang, J, Zhou, YP
core +1 more source
Probable Intersection Layouts and Effects on Traffic Flow at Ring Road upon the Operation of Multi Level Car Park at Tribhuvan International Airport [PDF]
E3S Web of ConferencesTrbhuvan international Airport (TIA) is only one International Airport in Kathamandu. It has one domestic and one international terminal. The road intersection at the access road of the TIA and the Ring Road is one of the important intersections of ...
Adhikari Prabesh +2 more
doaj +1 more source
Inherently workload-balanced clustered microarchitecture [PDF]
, 2005 The performance of clustered microarchitectures relies on steering schemes that try to find the best trade-off between workload balance and inter-cluster communication penalties.
Abella Ferrer, Jaume +1 more
core +1 more source