Results 1 to 10 of about 145,868 (280)
Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]
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 ...
Paul Jungeblut +2 more
doaj +4 more sources
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
STACK NUMBER INFLUENCE ON THE ACCURACY OF ASTER GDEM (V2) [PDF]
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
Stack-Number is Not Bounded by Queue-Number [PDF]
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
openaire +2 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
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
Three-Dimensional Graph Products with Unbounded Stack-Number
We prove that the stack-number of the strong product of three $n$-vertex paths is $Θ(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 maximum degree and unbounded stack-number.
David Eppstein +5 more
openaire +4 more sources
On Linear Layouts of Graphs [PDF]
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
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
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
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 ordering.
Jungeblut, Paul +2 more
openaire +2 more sources
Dual-stack host discovery method based on SSDP and DNS-SD protocol
With the exhaustion of the IPv4 addresses, the promotion and deployment of IPv6 has been accelerating.Dual-stack technology allows devices to enable both IPv4 and IPv6 protocols, which means that users are facing more security risks.Although the existing
Fan SHI, Yao ZHONG, Pengfei XUE, Chengxi XU
doaj +3 more sources

