Eulerian path - Open Access .click

Results 131 to 140 of about 32,353 (214)

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
openaire +2 more sources

On the complexity of the Eulerian path problem for infinite graphs

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 +2 more sources

Numerical Investigation on Multi-phase Flow of Pool-type Lead-cooled Fast Reactor under SGTR Accident

Yuanzineng kexue jishu
Steam generator tube rupture (SGTR) accident is one of the accident scenarios that must be considered during the design and safety analysis process of lead-cooled fast reactors (LFR).
CHEN Yutong1, , ZHANG Dalin1, , LIN Yue1, ZHANG Xisi2, TIAN Wenxi1, QIU Suizheng1, SU Guanghui1
doaj +1 more source

When Droplets Can "Think": Intelligent Testing in Digital Microfluidic Chips. [PDF]

Biosensors (Basel)
Luo Z, Li S, Long W, Chen R, Zheng J.
europepmc +1 more source

An Euler Graph-Based Path Planning Method for Additive Manufacturing Thin-Walled Cellular Structures of Continuous Fiber-Reinforced Thermoplastic Composites. [PDF]