Results 21 to 30 of about 1,825,425 (354)
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
Journal of Information Processing, 2013 Zachary Abel +5 more
openalex +3 more sources
Hamiltonian orthogeodesic alternating paths
Journal 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 mutually independent hamiltonian paths
Applied 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
On Hamiltonian alternating cycles and paths
Computational 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
Beyond the Fröhlich Hamiltonian: Path-integral treatment of large polarons in anharmonic solids [PDF]
Physical review B, 2020 The properties of an electron in a typical solid are modified by the interaction with the crystal ions, leading to the formation of a quasiparticle: the polaron.
Matthew Houtput, J. Tempere
semanticscholar +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
On Hamiltonian paths in distance graphs
Applied 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
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 paths and cycles in hypertournaments [PDF]
Journal of Graph Theory, 1997 If \(n\) and \(k\) are integers, \(n \geq k > 1\), a \(k\)-hypertournament \(T\) on \(n\) vertices consists of a set \(V\) of vertices, where \(|V|= n\), and a set \(A\) of \(k\)-tuples (``arcs'') of vertices such that for any \(k\)-subset \(S\) of \(V\), \(A\) contains exactly one of the \(k\)! \(k\)-tuples whose entries belong to \(S\). Note that a 2-
Gutin, Gregory, Yeo, A.
openaire +11 more sources
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