Results 281 to 290 of about 116,934 (311)
Some of the next articles are maybe not open access.

A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments

Journal of Algorithms, 1993
Summary: 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(n^2/\log n)\) processors on a CRCW PRAM, and \(O(\log n \log \log n)\) on an EREW PRAM using \(O(n^2/ \log n \log \log n ...
Evripidis Bampis   +3 more
openaire   +1 more source

Hamiltonian Kneser Graphs

Combinatorica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ya-Chen Chen, Zoltán Füredi
openaire   +1 more source

MEMRISTOR HAMILTONIAN CIRCUITS

International Journal of Bifurcation and Chaos, 2011
We prove analytically that 2-element memristive circuits consisting of a passive linear inductor in parallel with a passive memristor, or an active memristive device, can be described explicitly by a Hamiltonian equation, whose solutions can be periodic or damped, and can be represented analytically by the constants of the motion along the circuit ...
Makoto Itoh, Leon O. Chua
openaire   +2 more sources

Flow equations for Hamiltonians

Nuclear Physics B - Proceedings Supplements, 1994
A method to diagonalize or block-diagonalize Hamiltonians by means of an appropriate continuous unitary transformation is reviewed. We will outline (i) the procedure for the elimination of the electron-phonon interaction and the construction of the effective attractive electron-electron interaction, and (ii) the application to some systems with ...
openaire   +1 more source

The Hamiltonian Index of a Graph

Graphs and Combinatorics, 2001
The hamiltonian index \(\text{ham}(G)\) of a graph \(G\) is defined as the least \(n\) such that the \(n\)th iterated line graph \(L^n(G)=L(L^{n-1}(G))\) of \(G\) is hamiltonian. Improving results due to \textit{P. A. Catlin} et al. [J. Graph Theory 14, No. 3, 347-364 (1990; Zbl 0721.05044)] and \textit{M. Lovrečič Saražin} [Discrete Math. 134, No. 1-3,
openaire   +2 more sources

Non-KAM Hamiltonians

Physica Scripta, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

The Hamiltonian Way for Computing Hamiltonian Dynamics

1991
We present a survey of a recent comprehensive study on the numerical methods for Hamiltonian systems based on symplectic geometry, together the motivations for the research, justification for the symplectic approach adopted, some of the main results, their ramifications and their implications [1–9].
openaire   +1 more source

Hamiltonian structure of compartmental epidemiological models

Physica D: Nonlinear Phenomena, 2020
Angel Ballesteros   +2 more
exaly  

Contact Hamiltonian mechanics

Annals of Physics, 2017
Alessandro Bravetti, Diego Tapias
exaly  

Home - About - Disclaimer - Privacy