Results 121 to 130 of about 1,517 (142)
Some of the next articles are maybe not open access.

Graph Layout Using Queues

2013
We study the problem of laying out the edges of a graph using queues. In a k queue layout, vertices of the graph are placed in some linear order and each edge is assigned to exactly one of the k queues so that the edges assigned to each queue obey a first-in/first-out discipline.
Heath, Lenwood S., Rosenberg, Arnold L.
openaire   +2 more sources

Queue Layout of Bipartite Graph Subdivisions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
For an integer d > 0, a d-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into d sets of non-nested edges with respect to the vertex ordering. Recently V. Dujmovic and D. R. Wood showed that for every integer d ≥ 2, every graph G has a d-queue layout of a subdivision of G with 2⌈logdqn(G)⌉ + 1 division ...
openaire   +1 more source

Design of manufacturing plant layouts with queueing effects

Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146), 2002
We present a formulation of the plant layout problem where the objective is to minimize work-in-process. We show that the choice of layout has a direct impact on work-in-process accumulation, manufacturing lead time, achievable throughput rates, and required material handling capacity.
openaire   +1 more source

Queue Layouts of Strong Products: Wheel Graphs with Paths and Cycles

Journal of Interconnection Networks
A queue layout (respectively, strict queue layout) of a graph [Formula: see text] consists of a linear order of its vertices, and a partition of its edges into queues, such that no two edges in the same queue are nested (overlapping). The queue number [Formula: see text] is the minimum number of queues required in a queue layout of [Formula: see text].
Yueyang Hao, Xin Geng, Weihua Yang
openaire   +1 more source

Queue Layouts and Staircase Covers of Matrices

2013
A connection between a queue layout of an undirected graph and a staircase cover of its adjacency matrix is established. The connection is exploited to establish a number of combinatorial results relating the number of vertices, the number of edges, and the queue number of a queue layout.
Abrams, Marc   +5 more
openaire   +1 more source

Planar Graphs Have Bounded Queue-Number

Journal of the ACM, 2020
Vida Dujmovic   +2 more
exaly  

On Queue-Length Information when Customers Travel to a Queue

Manufacturing and Service Operations Management, 2021
Ricky Roet-Green, Refael Hassin
exaly  

Layout of Graphs with Bounded Tree-Width

SIAM Journal on Computing, 2005
Vida Dujmovic, David Wood, Pat Morin
exaly  

On the queue-number of the hypercube

Electronic Notes in Discrete Mathematics, 2011
Riste Škrekovski   +2 more
exaly  

Home - About - Disclaimer - Privacy