Results 151 to 160 of about 43,282 (195)
Queue layouts on folded hypercubes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xin Geng, Yueyang Hao, Weihua Yang
openalex +3 more sources
Transition from a functional system to a cellular system involves partitioning the machine and part populations. Partitioning the machine population degrades the queue time performance. This paper investigates whether splitting the part population into part families can offset the effect of partitioning the machine population on queue time. Queue times
Leela Nagasrinivasarao Pitchuka +2 more
openalex +3 more sources
Virtual cellular manufacturing combines the high production routing flexibility of the job shop layout with the efficiency in terms of set-up of traditional cells. However, since this is a relatively recent concept, the implementation of the virtual cell layout in industry is still almost inexistent, despite the significant potential that this layout ...
João Carlos Espíndola Ferreira +1 more
openalex +2 more sources
Queue Layouts of Strong Products: Wheel Graphs with Paths and Cycles
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
openalex +2 more sources
Queue Layouts and Staircase Covers of Matrices
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.
Marc Abrams +5 more
openalex +2 more sources
Topological Stack-Queue Mixed Layouts of Graphs
Miki Miyauchi
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Discrete Mathematics, 2012
A queue layout of a graph consists of a linear ordering $\sigma$ 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 $\sigma$. We show that the $n$-dimensional hypercube $Q_n$ has a layout into $n-\lfloor \log_2 n \rfloor$ queues for all $n\ge 1$.
Petr Gregor +2 more
openaire +1 more source
A queue layout of a graph consists of a linear ordering $\sigma$ 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 $\sigma$. We show that the $n$-dimensional hypercube $Q_n$ has a layout into $n-\lfloor \log_2 n \rfloor$ queues for all $n\ge 1$.
Petr Gregor +2 more
openaire +1 more source
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
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
Stack and Queue Layouts for Toruses and Extended Hypercubes
2010 43rd Hawaii International Conference on System Sciences, 2010Linear layouts play an important role in many applications including networks and VLSI design. Stack and queue layouts are two important types of linear layouts. We consider the stack number, s(G), and queue number, q(G), for multidimensional k-ary hypercubes and toruses.
S. Bettayeb +3 more
openaire +1 more source

