Results 11 to 20 of about 43,282 (195)
Discrete Mathematics & Theoretical Computer Science, 2004 A (k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +8 more sources
Linear Layouts of Graphs with Priority Queues [PDF]
Appears in Proc. 19th Algorithms and Data Structures Symposium (WADS 2025)
Emilio Di Giacomo +4 more
openalex +4 more sources
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring [PDF]
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 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.
Vida Dujmović, Pat Morin, David R. Wood
+5 more sources
Queue Layouts of Graphs with Bounded Degree and Bounded Genus [PDF]
, 2019 Motivated by the question of whether planar graphs have bounded queue-number, we prove that planar graphs with maximum degree $Δ$ have queue-number $O(Δ^{2})$, which improves upon the best previous bound of $O(Δ^6)$. More generally, we prove that graphs with bounded degree and bounded Euler genus have bounded queue-number.
Vida Dujmović, Pat Morin, David R. Wood
openalex +3 more sources
The Peculiarities of Extending Queue Layouts [PDF]
Appears in the Proceedings of the 51st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2025); 24 pages, 6 figures, 1 ...
Thomas Depian +3 more
openalex +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 +4 more
openalex +2 more sources
Design of a manufacturing facility layout with a closed loop conveyor with shortcuts using queueing theory and genetic algorithms [PDF]
Proceedings of the 2011 Winter Simulation Conference (WSC), 2011 Most current manufacturing facility layout problem solution methods aim at minimizing the total distance traveled, the material handling cost, and/or the time spent in the system (based on distance traveled at a specific speed). The methodology proposed in this paper solves the looped layout design problem for a looped layout manufacturing facility ...
Vernet Lasrado, Dima Nazzal
+5 more sources
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.
Heath, Lenwood S., Pemmaraju, Sriram V.
+6 more sources
Process analysis and optimal facility layout planning in manufacturing systems [PDF]
Yugoslav Journal of Operations Research, 2023 In this article, it is emphasized that the process analysis for companies is carried out by using the DISCO process mining program and the results are interpreted and developed.
Ceylan Cemil +3 more
doaj +1 more source
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the
Vida Dujmović, David R. Wood
doaj +2 more sources