Results 121 to 130 of about 32,353 (214)
Water Resources Research, Volume 62, Issue 3, March 2026.Abstract A deep understanding of flow regulation in river bifurcations is critical for downstream river management and flood control. The deltaic river network frequently contains the Hâshaped network node, where two main channels are linked together via a connecting channel, combining both bifurcation and confluence. However, flow structures and their
Zhaohui Deng +4 more
wiley +1 more source
Eulerian disjoint paths problem in grid graphs is NP-complete
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Discrete Mathematics, 1978 AbstractAn antidirected path [3] in a digraph is a path with consecutive edges directed either both towards or both away from their common vertex. An aneulerian digraph is a digraph that contains a closed antidirected path passing through each edge once.
openaire +2 more sources
Eulerian circuits and path decompositions in quartic planar graphs
, 2019 34 pages.
openaire +2 more sources
Wave run-up and stress imposed on a permeable coastal bed sample of the Caspian Sea
International Journal of Coastal and Offshore Engineering, 2016 This research aims to reconsider the wave run-up and eulerian schematic of flow contours and the fluid movement path in the sediment sample gathered from southern Caspian Seashore bed, using experimental method in wave flume.The general characteristics ...
mojtaba zoljoodi
doaj
Information in Strings: Enumeration of Eulerian Paths and Eulerian Components in Markov Sequences
, 2014 In this paper, we evaluate the number of Eulerian circuits that can be obtained by an arbitrary rotation in a Markovian string, i.e., corresponding to a given Markovian type. Since all rotations do not result in an Eulerian circuit, but several of them, called Eulerian components; we also investigate the number of Eulerian components that result from a
Jacquet, Philippe, Milioris, Dimitrios
openaire +1 more source
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths
, 2017 In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one.
Billaut, Jean-Charles +3 more
openaire +2 more sources
Eulerian digraphs and Dyck words, a bijection
, 2014 The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions.
Codara, Pietro +2 more
core
Eulerian magnitude homology: diagonality, injective words, and regular path homology
minor changes, improved ...
Caputi, Luigi, Menara, Giuliamaria
openaire +2 more sources
Polycycle omega-limit sets of flows on the compact Riemann surfaces and Eulerian path
, 2016 Let $(S, )$ be a pair of a closed oriented surface and $ $ be a real analytic flow with finitely many singularities. Let $x$ be a point of $S$ with the polycycle $ $-limit set $ (x)$. In this paper we give topological classification of $ (x)$. Our main theorem says that $ (x)$ is diffeomorphic to the boundary of a cactus in the $2$-sphere $S^{2}$.
Choy, Jaeyoo, Chu, Hahng-Yun
openaire +2 more sources