Results 1 to 10 of about 1,859,854 (274)
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 Å) 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 +9 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
New Sufficient Conditions for Hamiltonian Paths [PDF]
The Scientific World Journal, 2014 A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.
M. Sohel Rahman +2 more
doaj +4 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
DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM
Perner’s Contacts, 2010 Many practical problems of transportation can be transformed to the problem of finding Hamiltonian path or circle. It was proven, that this problem is NP-complete and thus can be very time-consuming for practical problem size. In this paper we present a
Karol Grondžák
doaj +1 more source
Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time
Algorithms, 2022 A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete.
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
doaj +1 more source
Quantum Zeno approach for molecular energies with maximum commuting initial Hamiltonians
Physical Review Research, 2021 We propose to use a quantum adiabatic and simulated-annealing framework to compute the ground state of small molecules. The initial Hamiltonian of our algorithms is taken to be the maximum commuting Hamiltonian that consists of a maximal set of commuting
Hongye Yu, Tzu-Chieh Wei
doaj +1 more source
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
Discussiones Mathematicae Graph Theory, 2021 Let k be an integer with k ≥ 2. A digraph is k-quasi-transitive, if for any path x0x1... xk of length k, x0 and xk are adjacent. Let D be a strong k-quasi-transitive digraph with even k ≥ 4 and diameter at least k +2.
Wang Ruixia
doaj +1 more source
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2022 A graph is called Hamiltonian extendable if there exists a Hamiltonian path between any two nonadjacent vertices. In this paper, we give an explicit formula of the minimum number of edges for Hamiltonian extendable graphs and we also characterize the ...
Yang Xiaojing, Xiong Liming
doaj +1 more source