Results 71 to 80 of about 32,353 (214)
NP-completeness of the Eulerian walk problem for a multiple graph
Моделирование и анализ информационных системIn this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)
Alexander V. Smirnov
doaj +1 more source
Decomposing 8-regular graphs into paths of length 4
, 2016 A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\"aggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\ell$ edges ...
Botler, Fábio, Talon, Alexandre
core +1 more source
Dynamics and model representation of two contrasting extreme precipitation events in the Sahel
Quarterly Journal of the Royal Meteorological Society, EarlyView.Hovmöller diagrams of the two investigated extreme precipitation events in Mali are shown for (i) IMERG observations, and ICOsahedral Nonhydrostatic model (ICON) runs with parameterization of explicit convection (ii) enabled and (iii) disabled. This work highlights that the commonly perceived benefit of using explicit convection in a state‐of‐the‐art ...
Souleymane Sanogo +4 more
wiley +1 more source
Reconstruction of DNA Sequences Through Eulerian Traversal of De Bruijn Graphs
MathematicsReconstructing a genome from collections of short DNA fragments is a fundamental problem in modern sequencing. Although genome assembly algorithms are widely used in practice, the mathematical conditions that allow exact reconstruction are not always ...
Baining Zhu, Siqi Liu, Suwei Liu
doaj +1 more source
On the complexity of the Eulerian closed walk with precedence path constraints problem [PDF]
Electronic Notes in Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kerivin, Hervé +2 more
openaire +2 more sources
On disjoint paths in acyclic planar graphs [PDF]
, 2010 We give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian.
Naves, Guyslain
core
On fractionality of the path packing problem
, 2008 In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths with ends in T such that the total weights of paths traversing each edge ...
A Frank +14 more
core +1 more source
Turbulent snow transport and accumulation: New reduced‐order models and diagnostics
Quarterly Journal of the Royal Meteorological Society, EarlyView.Our new reduced‐order models of snow particle transport provide high‐fidelity calculations of snow accumulation in turbulent flows at significantly reduced computational costs. Additional accumulation diagnostics from the reduced‐order model predict complex patterns of particle concentration in turbulent boundary layers via coherent flow structures in ...
Nikolas O. Aksamit +3 more
wiley +1 more source
Numerical simulation of the natural fragmentation of explosively loaded thick walled cylinders
Defence Technology, 2014 The ability to predict the natural fragmentation of an explosively loaded metal casing would represent a significant achievement. Physically-based material models permit the use of small scale laboratory tests to characterise and validate their ...
I.G. Cullis +4 more
doaj +1 more source
Parameterized Rural Postman Problem [PDF]
, 2014 The Directed Rural Postman Problem (DRPP) can be formulated as follows: given a strongly connected directed multigraph $D=(V,A)$ with nonnegative integral weights on the arcs, a subset $R$ of $A$ and a nonnegative integer $\ell$, decide whether $D$ has a
Gutin, Gregory +2 more
core