Results 31 to 40 of about 1,569,721 (239)
On eulerian and regular perfect path double covers of graphs
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karen Seyffarth, Chengde Wang
openalex +3 more sources
Long directed paths in Eulerian digraphs
, 2021 An old conjecture of Bollob s and Scott asserts that every Eulerian directed graph with average degree $d$ contains a directed cycle of length at least $ (d)$. The best known lower bound for this problem is $ (d^{1/2})$ by Huang, Ma, Shapira, Sudakov and Yuster.
Oliver Janzer +2 more
openalex +4 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
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.
Kenneth A. Berman
openalex +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 ...
Nicanor Carrasco-Vargas +2 more
openalex +3 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 +4 more sources
Eulerian paths and a problem concerning n -arc connected spaces
Topology and its Applications, 2013 Abstract In this paper we give, in response to a question of Espinoza, Gartside and Mamatelashvili, an example of an n -arc connected (metric) continuum which is not ( n + 1 ) -arc connected for every n ⩾ 7 .
Alessandro Fedeli, Attilio Le Donne
openalex +4 more sources
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks [PDF]
, 2010 SOFSEM ...
Maxim A. Babenko +2 more
openalex +5 more sources
Modelling the Eulerian Path Problem using a String Matching Framework
, 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ă
openalex +4 more sources
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
Philippe Jacquet, Dimitrios Milioris
openalex +3 more sources