Results 1 to 10 of about 144,488 (176)
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(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 +7 more sources
Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2022 The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Jungeblut, Paul +2 more
core +6 more sources
Stack-number is not bounded by queue-number [PDF]
Combinatorica, 2021 We describe a family of graphs with queue-number at most 4 but unbounded stack-number. This resolves open problems of Heath, Leighton and Rosenberg (1992) and Blankenship and Oporowski (1999)
Dujmović, Vida +4 more
core +2 more sources
STACK NUMBER INFLUENCE ON THE ACCURACY OF ASTER GDEM (V2) [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2017 In this research, the influence of stack number (STKN) on the accuracy of Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) Global DEM (GDEM) has been investigated. For this purpose, two data sets of ASTER and Reference DEMs from two
S. M. J. Mirzadeh +2 more
doaj +3 more sources
Three-dimensional graph products with unbounded stack-number
Discrete & Computational Geometry, 2022 We prove that the stack-number of the strong product of three $n$-vertex paths is $\Theta(n^{1/3})$. The best previously known upper bound was $O(n)$. No non-trivial lower bound was known. This is the first explicit example of a graph family with bounded
Eppstein, David +5 more
core +4 more sources
On Families of Planar DAGs with Constant Stack Number
, 2021 A $k$-stack layout (or $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order.
Nöllenburg, Martin, Pupyrev, Sergey
core +2 more sources
Graphs with queue number three and unbounded stack number
, 2023 We prove that the graphs $T\boxslash P$ have unbounded stack number and queue number $3$, where $T$ is a tree and $P$ is a path, and $\boxslash$ denotes the graph strong product but with one of the directions removed.
Leung, Yui Hin Arvin
core +2 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +3 more sources
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 \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
doaj +1 more source
Numerical Study on the Plume Behavior of Multiple Stacks of Container Ships
Atmosphere, 2021 This paper showed different plume behaviors of exhausts from different number of stacks of the container ship, using CFD code PHOENICS version 6.0. The plume behavior was quantitatively analyzed by mass fraction of the pollutant in the exhaust and plume ...
Yine Xu, Qi Yu, Yan Zhang, Weichun Ma
doaj +1 more source