Results 261 to 270 of about 1,157,729 (290)
Some of the next articles are maybe not open access.
On Hamiltonian cycles and Hamiltonian paths
Information Processing Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Sohel Rahman, Mohammad Kaykobad
openaire +2 more sources
Journal of Graph Theory, 1983
AbstractThe Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Gary Chartrand +2 more
openaire +1 more source
AbstractThe Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Gary Chartrand +2 more
openaire +1 more source
A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments
Journal of Algorithms, 1993Summary: 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
On Hamiltonian Paths and a Chain Metric
Cybernetics and Systems Analysis, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burdyuk, V. Ya., Kakhichko, A. A.
openaire +2 more sources
On the hamiltonian path graph of a graph
Journal of Graph Theory, 1987AbstractThe hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and v are adjacent if and only if F contains a hamiltonian u − v path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian graphs isomorphic to their hamiltonian path ...
openaire +3 more sources
Nanopore decoding for a Hamiltonian path problem
Nanoscale, 2021We describe rapid and label-free decoding of the DNA-computed output for a directed Hamiltonian path problem using nanopore technology.
Sotaro Takiguchi, Ryuji Kawano
openaire +2 more sources
Hamiltonian path in permutation graphs
Theoretical Computer ScienceThe Hamiltonian path problem is NP-complete for general graphs. The notion of a follow-up vertex in a permutation graph is introduced in this research, with respect to its Hasse diagram. A necessary and sufficient condition is justified for the existence of a Hamiltonian path in a permutation graph in terms of the existence of a follow-up vertex ...
Krishna Daripa, Alak Kumar Datta
openaire +2 more sources
Hamiltonian Paths in the Square of a Tree
2011We introduce a new family of graphs for which the Hamiltonian path problem is non-trivial and yet has a linear time solution. The square of a graph G=(V,E), denoted as G2, is a graph with the set of vertices V, in which two vertices are connected by an edge if there exists a path of length at most 2 connecting them in G.
Jakub Radoszewski, Wojciech Rytter
openaire +1 more source
Hamiltonian Path-Integral Methods
Reviews of Modern Physics, 1966A path-integral formulation of quantum mechanics is investigated which is closely related to that of Feynman. It differs from Feynman's formulation in that it involves the Hamiltonian function of the canonically conjugate coordinates and momenta.
openaire +1 more source
On the Stability of Approximation for Hamiltonian Path Problems
2005We consider the problem of finding a cheapest Hamiltonian path of a complete graph satisfying a relaxed triangle inequality, i.e., such that for some parameter β > 1, the edge costs satisfy the inequality c({x,y}) ≤ β(c({x,z}) + c({z,y})) for every triple of vertices x, y, z.
FORLIZZI, LUCA +3 more
openaire +7 more sources