Results 11 to 20 of about 1,825,425 (354)
Hamiltonian path analysis of viral genomes [PDF]
Nature 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 A) by Koning et al.1, and the subsequent ...
Reidun Twarock +2 more
doaj +8 more sources
An Image Encryption Algorithm Based on Random Hamiltonian Path [PDF]
Entropy, 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 +3 more sources
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable
Discussiones Mathematicae Graph Theory, 2020 A graph G is k-Hamiltonian if for all X ⊂ V (G) with |X| ≤ k, the subgraph induced by V (G) \ X is Hamiltonian. A graph G is k-path-coverable if V (G) can be covered by k or fewer vertex disjoint paths.
Liu Weijun +3 more
doaj +2 more sources
Parallel Backtracking Algorithm for Hamiltonian Path Search [PDF]
Communications, 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
Solving a Hamiltonian Path Problem with a bacterial computer
Journal of Biological Engineering, 2009 Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity
Treece Jessica +18 more
doaj +2 more sources
On the existence of a Hamiltonian path in a graph
Information 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 +3 more sources
Hamiltonian paths in oriented graphs
Journal 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 +4 more sources
Hamiltonian formalism for path-dependent Lagrangians [PDF]
Physical 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
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number [PDF]
arXiv.org, 2023 A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to the first ...
Nikola Jedličková, Jan Kratochv'il
semanticscholar +1 more source
2-generated Cayley digraphs on nilpotent groups have hamiltonian paths [PDF]
, 2011 Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path.
Dave Witte Morris
openalex +6 more sources