Results 11 to 20 of about 2,059,443 (151)
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 on
Roman Glebov, Yury Person, Wilma Weps
openaire +5 more sources
Hamiltonian and Variational Linear Distributed Systems [PDF]
, 2002 We use the formalism of bilinear- and quadratic differential forms in order to study Hamiltonian and variational linear distributed systems. It was shown in [1] that a system described by ordinary linear constant-coefficient differential equations is ...
Rapisarda, P. +5 more
core +2 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
Universally Hard Hamiltonian Cycle Problem Instances [PDF]
, 2022 In 2021, evolutionary algorithms found the hardest-known yes and no instances for the Hamiltonian cycle problem. These instances, which show regularity patterns, require a very high number of recursions for the best exact backtracking algorithm ...
Thomson, Sarah L +2 more
core +1 more source
Extending Complex Conjugate Control to Nonlinear Wave Energy Converters
Journal of Marine Science and Engineering, 2020 This paper extends the concept of Complex Conjugate Control (CCC) of linear wave energy converters (WECs) to nonlinear WECs by designing optimal limit cycles with Hamiltonian Surface Shaping and Power Flow Control (HSSPFC).
David G. Wilson +4 more
doaj +1 more source
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
AKCE International Journal of Graphs and Combinatorics, 2016 The generalised Sudoku problem with N symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where N is a perfect square.
Michael Haythorpe
doaj +1 more source
Finding hidden hamiltonian cycles [PDF]
Random Structures & Algorithms, 1991 AbstractConsider a random graph G composed of a Hamiltonian cycle on n labeled vertices and dn random edges that “high” the cycle. Is it possible to unravel the structures, that is, to efficiently find a Himiltonian cycle in G? We describe an O(n3 log n)‐step algorithm A for this purpose, and prove that it succeeds almost surely. Part one of A properly
Andrei Z. Broder +2 more
openaire +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. +5 more
core +2 more sources
Enumerating Hamiltonian Cycles [PDF]
The Electronic Journal of Combinatorics, 2014 A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king's graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published.
openaire +5 more sources
The Traveling Salesman Problem for Cubic Graphs
Journal of Graph Algorithms and Applications, 2007 We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3) ≈ 1.260n and linear space. Our algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound.
David Eppstein
doaj +1 more source