Results 111 to 120 of about 43,243 (154)
Health care worker-reported barriers and potential facilitators of acute lower respiratory infection care deliver for children at Mchinji District Hospital in Malawi. [PDF]
IJID RegHooli S +7 more
europepmc +1 more source
Benchmarking Modern Day Pencil Beam Scanning Proton Therapy Treatment Times: Insights From Real Time Location Service Treatment Time Data. [PDF]
Int J Part TherMcConnell K +7 more
europepmc +1 more source
Contraction Heuristics for Tensor Decision Diagrams. [PDF]
Entropy (Basel)Larsen CB +3 more
europepmc +1 more source
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
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing, 1993Summary: Stack layouts and queue layouts of undirected graphs have been used to model problems in fault-tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags).
Heath, Lenwood S. +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 of Directed Acyclic Graphs: Part II
SIAM Journal on Computing, 1999Summary: Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags).
Heath, Lenwood S., Pemmaraju, Sriram V.
openaire +2 more sources
Queue layouts on folded hypercubes
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xin Geng, Yueyang Hao, Weihua Yang
openaire +2 more sources