Results 131 to 140 of about 43,475 (165)
Stack and Queue Layouts of Posets [PDF]
SIAM Journal on Discrete Mathematics, 1997 Summary: The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and the queuenumber of its covering graph.
Lenwood S Heath
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Queue Layouts of Toroidal Grids
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014Kung-Jui Pai, Jou-Ming Chang
exaly +2 more sources
Queue layouts on folded hypercubes
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
weihua yang
exaly +3 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).
Lenwood S Heath
exaly +3 more sources
Transportation Research Procedia, 2017 Abstract This paper modeled and analyzed the queue length estimation mechanisms by different layout strategies. According to the lane allocations of intersections, several feasible layout strategies of magnetic sensors are proposed. Furthermore, a layout strategy with one single magnetic sensor is proposed to estimate the queue length.
Haijian Li, Lingqiao Qin
exaly +2 more sources
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
Topological Stack-Queue Mixed Layouts of Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020exaly +2 more sources
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