Results 271 to 280 of about 154,862 (311)

Dynamical Projective Operatorial Approach (DPOA): Theory and Applications to Pump-Probe Setups and Semiconductors. [PDF]

Materials (Basel)
Eskandari-Asl A, Avella A.
europepmc   +1 more source

Nonadiabatic Field: A Conceptually Novel Approach for Nonadiabatic Quantum Molecular Dynamics. [PDF]

J Chem Theory Comput
Wu B, Li B, He X, Cheng X, Ren J, Liu J.
europepmc   +1 more source

Robustness Analysis on Joint Path-following Control of a Snake-like Robot Using Port-Hamiltonian Model

A. Kondo, Ryo Ariizumi, Toru Asai, Shun‐ichi Azuma   +3 more
openalex   +2 more sources

High resolution infrared spectroscopy of monodeutero-oxirane (<i>c</i>-C₂H₃DO) and analysis of two fundamentals between 820 and 950 cm^-1.

Phys Chem Chem Phys
Albert S, Chen Z, Keppler K, Wichmann G, Quack M, Stohner J, Schurig V, Trapp O.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
A 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]

, 1983
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, George Pólya, Donald R. Woods   +2 more
openaire   +1 more source

Hamiltonian path graphs

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, E. A. Nordhaus, S. F. Kapoor   +2 more
openaire   +2 more sources

A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments [PDF]

Journal of Algorithms, 1993
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, Miklos Santha, Miklos Santha, M. El Haddad, Yannis Manoussakis   +4 more
openaire   +2 more sources

Nanopore decoding for a Hamiltonian path problem

Nanoscale, 2021
We 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

2005
We 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, J. HROMKOVIC, PROIETTI, GUIDO, S. SEIBERT   +3 more
openaire   +7 more sources