Results 1 to 10 of about 32,306 (170)
Eulerian Paths with Regular Constraints [PDF]
, 2016 Labeled graphs, in which edges are labeled by letters from some alphabet Sigma, are extensively used to model many types of relations associated with actions, costs, owners, or other properties. Each path in a labeled graph induces a word in Sigma^* -- the one obtained by concatenating the letters along the edges in the path.
Kupferman, Orna, Vardi, Gal
openaire +5 more sources
An Eulerian path approach to local multiple alignment for DNA sequences. [PDF]
Proc Natl Acad Sci U S A, 2005 Expensive computation in handling a large number of sequences limits the application of local multiple sequence alignment. We present an Eulerian path approach to local multiple alignment for DNA sequences. The computational time and memory usage of this approach is approximately linear to the total size of sequences analyzed; hence, it can handle ...
Zhang Y, Waterman MS.
europepmc +5 more sources
Critical-edge based tabu search algorithm for solving large-scale multi-vehicle Chinese postman problem [PDF]
Scientific ReportsThe min–max multi-vehicle Chinese postman problem is an NP-hard problem, which is widely used in path planning problems based on road network graphs, such as urban road structure probing planning, urban road underground cavity detection planning, high ...
Jizhou Tang +3 more
doaj +2 more sources
An Eulerian path approach to DNA fragment assembly. [PDF]
Proc Natl Acad Sci U S A, 2001 For the last 20 years, fragment assembly in DNA sequencing followed the “overlap–layout–consensus” paradigm that is used in all currently available assembly tools. Although this approach proved useful in assembling clones, it faces difficulties in genomic shotgun assembly.
Pevzner PA, Tang H, Waterman MS.
europepmc +4 more sources
A Feasibility Study on Application of Eulerian Path Concept to Design of Water Supply Pipe Network [PDF]
대한환경공학회지, 2022 Objectives This study attempted to investigated the advantages that can be obtained by applying the concept of ‘Eulerian path’ called ‘one-touch drawing’ to the block type water supply network which actually has been operating in Korea.
Sukmin Yoon +4 more
doaj +1 more source
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source
A Feasibility Study on Applying the Concept of Removing Odd Nodes to Design of Water Supply Pipe Network [PDF]
대한환경공학회지, 2023 Objectives In this study, the concept of the Eulerian path, which has already been proposed as a solution to the problem of head loss and residual chlorine reduction caused by complexity of nodes and pipelines, and the non-Euerian path proposed in this ...
Si Hyeong Park +3 more
doaj +1 more source
Note on Long Paths in Eulerian Digraphs [PDF]
The Electronic Journal of Combinatorics, 2021 Long paths and cycles in Eulerian digraphs have received a lot of attention recently. In this short note, we show how to use methods from [Knierim, Larcher, Martinsson, Noever, JCTB 148:125--148] to find paths of length $d/(\log d+1)$ in Eulerian digraphs with average degree $d$, improving the recent result of $\Omega(d^{1/2+1/40})$.
Knierim, Charlotte +2 more
openaire +3 more sources
Path-integrated Lagrangian measures from the velocity gradient tensor [PDF]
Nonlinear Processes in Geophysics, 2013 Spatial maps of the finite-time Lyapunov exponent (FTLE) have been used extensively to study LCS in two-dimensional dynamical systems, in particular with application to transport in unsteady fluid flows.
V. Pérez-Muñuzuri, F. Huhn
doaj +1 more source
The short toric polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We introduce the short toric polynomial associated to a graded Eulerian poset. This polynomial contains the same information as Stanley's pair of toric polynomials, but allows different algebraic manipulations.
Gábor Hetyei
doaj +1 more source