Results 1 to 10 of about 7,966 (208)

Hamiltonian path analysis of viral genomes [PDF]

open access: yesNature Communications, 2018
Cryo-electron microscopy (EM) is undergoing a revolution, enabling the study of viral pathogens in unprecedented detail. The asymmetric EM reconstruction of bacteriophage MS2 at medium resolution (8.7 Å) by Koning et al.1, and the subsequent reconstruction at even higher resolution (3.6 Å) by Dai et al.2 revealed the structures of both the protein ...
Reidun Twarock   +2 more
doaj   +7 more sources

An Image Encryption Algorithm Based on Random Hamiltonian Path [PDF]

open access: yesEntropy, 2020
In graph theory, Hamiltonian path refers to the path that visits each vertex exactly once. In this paper, we designed a method to generate random Hamiltonian path within digital images, which is equivalent to permutation in image encryption.
Wei Zhang   +4 more
doaj   +2 more sources

On the existence of a Hamiltonian path in a graph

open access: bronzeInformation and Control, 1968
A transition probability matrix is associated with an graph (X, T), and the classification of states in the homogenons Markov chain defined by this transition probability matrix is applied to a graph theory. Several sets of necessary and sufficient conditions for a graph to have a Hamiltonian circuit are obtained by means of the classification of these
Yoshiko Takenaka
openalex   +2 more sources

Hamiltonian paths in oriented graphs

open access: bronzeJournal of Combinatorial Theory, Series B, 1976
AbstractA short proof is given of Meyniel's theorem on Hamiltonian cycles in oriented graphs. Analogous conditions are obtained for a graph to be Hamiltonianconnected.
Maria Overbeck-Larisch
openalex   +3 more sources

Hamiltonian formalism for path-dependent Lagrangians [PDF]

open access: greenPhysical Review D, 1987
A presymplectic structure for path-dependent Lagrangian systems is set up such that, when applied to ordinary Lagrangians, it yields the familiar Legendre transformation. It is then applied to derive a Hamiltonian formalism and the conserved quantities for those predictive invariant systems whose solutions also satisfy a Fokker-type action principle.
Xavier Jaén   +3 more
openalex   +6 more sources

On mutually independent hamiltonian paths

open access: bronzeApplied Mathematics Letters, 2005
AbstractLet P1=〈v1,v2,v3,…,vn〉 and P2=〈u1,u2,u3,…,un〉 be two hamiltonian paths of G.
Yuan‐Hsiang Teng   +3 more
openalex   +3 more sources

Hamiltonian orthogeodesic alternating paths

open access: bronzeJournal of Discrete Algorithms, 2012
AbstractLet R be a set of red points and let B be a set of blue points. The point set P=R∪B is called equitable if ||B|−|R||⩽1 and it is called general if no two points are vertically or horizontally aligned. An orthogeodesic alternating path on P is a path such that each edge is an orthogeodesic chain connecting points of different color and such that
Emilio Di Giacomo   +4 more
openalex   +7 more sources

On Hamiltonian alternating cycles and paths

open access: bronzeComputational Geometry, 2017
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same ...
Mercè Claverol Aguas   +4 more
openalex   +8 more sources

Parallel Backtracking Algorithm for Hamiltonian Path Search [PDF]

open access: hybridCommunications, 2009
The speed of calculations is a common problem to tackle in many areas of scientific research and real life. This paper presents an implementation of a parallel backtracking algorithm.
Karol Grondzak, Penka Martincova
doaj   +2 more sources

On Hamiltonian paths in distance graphs

open access: bronzeApplied Mathematics Letters, 2011
AbstractFor a finite set D⊆N with gcd(D)=1, we prove the existence of some n∈N such that the distance graph PnD with vertex set {0,1,…,n−1} in which two vertices u and v are adjacent exactly if |u−v|∈D, has a Hamiltonian path with endvertices 0 and n−1. This settles a conjecture posed by Penso et al. [L.D. Penso, D. Rautenbach, J.L.
Christian Löwenstein   +2 more
openalex   +3 more sources

Home - About - Disclaimer - Privacy