Results 271 to 280 of about 154,862 (311)
Dynamical Projective Operatorial Approach (DPOA): Theory and Applications to Pump-Probe Setups and Semiconductors. [PDF]
Eskandari-Asl A, Avella A.
europepmc +1 more source
Nonadiabatic Field: A Conceptually Novel Approach for Nonadiabatic Quantum Molecular Dynamics. [PDF]
Wu B, Li B, He X, Cheng X, Ren J, Liu J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Hamiltonian cycles and Hamiltonian paths
Information Processing Letters, 2005A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths.
Mohammad Kaykobad, M. Sohel Rahman
openaire +1 more source
Hamiltonian and Eulerian Paths [PDF]
March 14. Hamiltonian and Eulerian paths and cycles come under the general heading of “de Bruijn sequences”. The specific terms “Hamiltonian” and “Eulerian” are somewhat better known; hence this chapter has been named after them rather than de Bruijn.
Robert E. Tarjan+2 more
openaire +1 more source
Journal of Graph Theory, 1983
AbstractThe Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Gary Chartrand+2 more
openaire +2 more sources
AbstractThe Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Gary Chartrand+2 more
openaire +2 more sources
A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments [PDF]
We propose a parallel algorithm which reduces the problem of computing Hamiltonian cycles in tournaments to the problem of computing Hamiltonian paths. The running time of our algorithm is O(log n) using O(n2/log n) processors on a CRCW PRAM, and O(log n log log n) on an EREW PRAM using O(n2/log n log log n) processors.
Evripidis Bampis+4 more
openaire +2 more sources
Nanopore decoding for a Hamiltonian path problem
Nanoscale, 2021We describe rapid and label-free decoding of the DNA-computed output for a directed Hamiltonian path problem using nanopore technology.
Sotaro Takiguchi, Ryuji Kawano
openaire +3 more sources
On the Stability of Approximation for Hamiltonian Path Problems
2005We consider the problem of finding a cheapest Hamiltonian path of a complete graph satisfying a relaxed triangle inequality, i.e., such that for some parameter β > 1, the edge costs satisfy the inequality c({x,y}) ≤ β(c({x,z}) + c({z,y})) for every triple of vertices x, y, z.
FORLIZZI, LUCA+3 more
openaire +7 more sources