Results 21 to 30 of about 3,139,455 (314)
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
Hidden Hamiltonian Cycle Recovery via Linear Programming [PDF]
Operational Research, 2018 We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an $n$-vertex complete graph that needs to be inferred from noisy edge measurements.
V. Bagaria +4 more
semanticscholar +1 more source
Looking for the Hardest Hamiltonian Cycle Problem Instances
International Joint Conference on Computational Intelligence, 2020 : We use two evolutionary algorithms to make hard instances of the Hamiltonian cycle problem. Hardness, or fitness, is defined as the number of recursions required by Vandegriend-Culberson, the best known exact backtracking algorithm for the problem.
J. Sleegers, D. V. D. Berg
semanticscholar +1 more source
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width [PDF]
Algorithmica, 2017 In this paper, we prove that, given a clique-width k-expression of an n-vertex graph, Hamiltonian Cycle can be solved in time nO(k)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Benjamin Bergougnoux +2 more
semanticscholar +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
Hamiltonian cycles in polyhedral maps [PDF]
Proceedings - Mathematical Sciences, 2017 14 ...
Maity, Dipendu, Upadhyay, Ashish Kumar
openaire +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 +4 more sources
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
Limit cycles of planar piecewise linear Hamiltonian differential systems with two or three zones
Electronic Journal of Qualitative Theory of Differential Equations, 2022 In this paper, we study the existence of limit cycles in continuous and discontinuous planar piecewise linear Hamiltonian differential system with two or three zones separated by straight lines and such that the linear systems that define the piecewise ...
Claudio Pessoa, Ronisio Ribeiro
doaj +1 more source
Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations [PDF]
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, 2017 Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of the output would indeed be an obvious consequence of some chaos properties ...
S. Contassot-Vivier +3 more
semanticscholar +1 more source