Results 11 to 20 of about 1,569,721 (239)
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 +5 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 +8 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 +9 more sources
International Journal of Pure and Applied Mathematics Research, 2023 \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, graphicx, tikz, color} \usepackage[bookmarksnumbered, colorlinks, plainpages]{hyperref} % use Unicode characters - try changing the option if you run into troubles with special
Henry Garrett
semanticscholar +4 more sources
On the complexity of the Eulerian closed walk with precedence path constraints problem [PDF]
Electronic Notes in Discrete Mathematics, 2010 AbstractThe Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some precedence constraints specified by paths of the digraph, then the problem becomes NP-complete.
Hervé Kerivin +2 more
semanticscholar +6 more sources
International Journal of Innovation in Engineering, 2023 In the modern era, graph theory is considered a useful tool for quantification and simplification of various dynamic components in complex systems. By representing elements as nodes and their connections as edges, graph theory can transform anything from
Hossein Jafari +2 more
semanticscholar +5 more sources
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})$.
Charlotte Knierim +2 more
+7 more sources
Eulerian-Type-Path-Neighbor In SuperHyperGraphs [PDF]
, 2023 “Book #164” [ADDRESSED CITATION] [HG164b] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7851893). @googlebooks:https://books.google.com/books/about?id=- @GooglePlay:https://play.google.com/store/books/details?id=- @ResearchGate: https://www.researchgate.net/publication/- @WordPress: https:
Henry Garrett
openalex +2 more sources
Eulerian-Type-Path-Cut In SuperHyperGraphs [PDF]
, 2023 [ADDRESSED CITATION] [HG162b] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7835063). In this scientific research book, there are some scientific research chapters on “Extreme Eulerian-Type-Path-Cut In SuperHyperGraphs” and “Neutrosophic Eulerian-Type-Path-Cut In SuperHyperGraphs” about some ...
Henry Garrett
openalex +2 more sources
Edge-Disjoint Paths in Eulerian Digraphs [PDF]
Proceedings of the 56th Annual ACM Symposium on Theory of ComputingDisjoint paths problems are among the most prominent problems in combinatorial optimisation. The edge- as well as the Vertex-Disjoint Paths problem are NP-complete, both on directed and undirected graphs. But on undirected graphs, Robertson and Seymour developed an algorithm for both problems that runs in cubic time for every fixed number p of ...
Dario Cavallaro +2 more
+6 more sources