Results 31 to 40 of about 3,188,937 (280)
A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles [PDF]
Journal of Mathematics and Physics, 2019 Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the number of variables. Here we generalise this approach.
Y. Ge, V. Dunjko
semanticscholar +1 more source
Hamiltonian Cycles in T-Graphs [PDF]
Discrete & Computational Geometry, 2000 The vertices and polygonal edges of the planar Archimedean tiling \(3^6\) of the plane is called the triangular tiling graph (TTG). A subgraph \(G\) of TTG is linearly convex if, for every line \(L\) which contains an edge of TTG, the set \(L \cap G\) is a (possibly degenerated or empty) line segment.
Reay, J. R., Zamfirescu, T.
openaire +2 more sources
Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs [PDF]
IEEE International Conference on Distributed Computing Systems, 2018 We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we present a randomized distributed algorithm for the G(n, p) random graph model, with number of nodes n and p = c ln n/n^δ (for ...
Soumyottam Chatterjee +3 more
semanticscholar +1 more source
Hamiltonian cycles and travelling salesfolk
International Journal of Science and Research (IJSR), 2023 A method is given in this paper that makes it easier to solve both the Hamiltonian cycle problem and the travelling salesman problem in any number of space dimensions and in both their directed and undirected varieties.
openaire +1 more source
On a computer-aided approach to the computation of Abelian integrals [PDF]
, 2011 An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems.
A. Neumaier +27 more
core +2 more sources
Types of triangle in plane Hamiltonian triangulations and applications to domination and k-walks [PDF]
, 2019 We investigate the minimum number t(0)(G) of faces in a Hamiltonian triangulation G so that any Hamiltonian cycle C of G has at least t(0)(G) faces that do not contain an edge of C.
Brinkmann, Gunnar +2 more
core +2 more sources
Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs [PDF]
Electronic Journal of Combinatorics, 2019 A graph admitting a perfect matching has the Perfect–Matching–Hamiltonian property (for short the PMH–property) if each of its perfect matchings can be extended to a hamiltonian cycle. In this paper we establish some sufficient conditions for a graph $G$
M. Abreu +4 more
semanticscholar +1 more source
Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version [PDF]
Contributions Discret. Math., 2017 We prove for all k\geq 4 and 1\leq \ell
J. D. O. Bastos +4 more
semanticscholar +1 more source
On Extremal Hypergraphs for Hamiltonian Cycles [PDF]
Electronic Notes in Discrete Mathematics, 2011 We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur n- and Dirac-type results. While the Tur n-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely ...
Glebov, Roman, Person, Yury, Weps, Wilma
openaire +3 more sources
Hamiltonian cycles in 3‐tough 2K2‐free graphs [PDF]
Journal of Graph Theory, 2017 A graph is called 2 K 2 ‐free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25‐tough 2 K 2 ‐free graph with at least three vertices is Hamiltonian.
Songling Shan
semanticscholar +1 more source