Results 11 to 20 of about 1,157,729 (290)
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 +5 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
Parallel Backtracking Algorithm for Hamiltonian Path Search
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
Hamiltonian path analysis of viral genomes [PDF]
Nature Communications, 2018 Reidun Twarock +2 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 +2 more sources
On regular 2-path Hamiltonian graphs
Discrete Applied Mathematics20.
Weihua Yang
exaly +5 more sources
Lithium Niobate Electro-Optic Photonic Processor for Variational Quantum Eigensolver. [PDF]
Adv Sci (Weinh)An integrated lithium‐niobate‐on‐insulator ququart processor implements an electro‐optically controlled photonic variational quantum eigensolver using single photons encoded in four path modes. Bell‐basis‐emulating ququart projective measurements reduce measurement settings while achieving chemical‐accuracy‐level molecular‐energy estimation.
Lee J +11 more
europepmc +2 more sources
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
Linear Hamiltonian behaviors and bilinear differential forms [PDF]
, 2004 We study linear Hamiltonian systems using bilinear and quadratic differential forms. Such a representation-free approach allows us to use the same concepts and techniques to deal with systems isolated from their environment and with systems subject to ...
Rapisarda, P. +7 more
core +3 more sources