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
DNA sequence assembly and multiple sequence alignment by an Eulerian path approach.
Cold Spring Harbor Symposia on Quantitative Biology, 2003 We describe an Eulerian path approach to the DNA fragment assembly that was originated by Idury and Waterman 1995, and then advanced by Pevzner et al. 2001b. This combinatorial approach bypasses the traditional “overlap-layout-consensus” approach and successfully resolved some of the troublesome repeats in practical assembly projects.
Y. Zhang, M. Waterman
semanticscholar +3 more sources
Eulerian paths and a problem concerning n -arc connected spaces
Topology and its Applications, 2014 In this paper, the authors build an example of an \(n\)-arc connected (metric) continuum, which is not a \((n+1)\)-arc connected for every \(n \geq 7\) using Euler's Theorem: A graph has a surjective Eulerian path if and only if it has at most two odd vertices.
FEDELI, Alessandro, Le Donne A.
openaire +3 more sources
Infinite Eulerian paths are computable on graphs with vertices of infinite degree [PDF]
, 2023 Revised ...
Nicanor Carrasco-Vargas
openaire +3 more sources
Modelling the Eulerian Path Problem using a String Matching Framework [PDF]
, 2005 The well-known Eulerian path problem can be solved in polynomial time (more exactly, there exists a linear time algorithm for this problem). In this paper, we model the problem using a string matching framework, and then initiate an algorithmic study on a variant of this problem, called the (2,1)-STRING-MATCH problem (which is actually a generalization
Dragoş Trincă
openaire +3 more sources
Polycycle omega-limit sets of flows on the compact Riemann surfaces and Eulerian path [PDF]
, 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 +3 more sources
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks [PDF]
, 2010 SOFSEM ...
Babenko, Maxim +2 more
+6 more sources
A proof of some Schützenberger‐type results for Eulerian paths and circuits on digraphs [PDF]
International Journal of Mathematics and Mathematical Sciences, 1993 This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when the number of arcs is at least twice the number of vertices of a digraph.
Byoung-Song Chwe
openaire +4 more sources
On the complexity of the Eulerian path problem for infinite graphs [PDF]
We revisit the problem of algorithmically deciding whether a given infinite connected graph has an Eulerian path, namely, a path that uses every edge exactly once. It has been recently observed that this problem is $D_3^0$-complete for graphs that have a computable description, whereas it is $Π_2^0$-complete for graphs that have a highly computable ...
Carrasco-Vargas, Nicanor +2 more
openaire +3 more sources
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 +4 more sources