Results 11 to 20 of about 3,139,455 (314)
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 Stephen Alstrup +3 more
openalex +2 more sources
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +2 more sources
High-dimensional Clustering onto Hamiltonian Cycle [PDF]
International Conference on Machine Learning, 2023 Clustering aims to group unlabelled samples based on their similarities. It has become a significant tool for the analysis of high-dimensional data.
Tianyi Huang +3 more
semanticscholar +1 more source
The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No
SN Computer Science, 2022 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, Daan van den Berg
semanticscholar +1 more source
A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology
Computers Materials & Continua, 2021 : Many routing protocols, such as distance vector and link-state protocols are used for finding the best paths in a network. To find the path between the source and destination nodes where every node is visited once with no repeats, Hamiltonian and ...
Adnan A. Hnaif +3 more
semanticscholar +1 more source
Distribution System State Estimation Using the Hamiltonian Cycle Theory
IEEE Transactions on Smart Grid, 2015 Jônatas Boás Leite +1 more
openalex +3 more sources
Counting Traversing Hamiltonian Cycles in Tiled Graphs
Mathematics, 2023 Recently, the problem of counting Hamiltonian cycles in 2-tiled graphs was resolved by Vegi Kalamar, Bokal, and Žerak. In this paper, we continue our research on generalized tiled graphs.
Alen Vegi Kalamar
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
Broder, Andrei Z. +2 more
openaire +1 more source
Discrete Mathematics, 2022 If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.
Vaidy Sivaraman, Thomas Zaslavsky
openaire +3 more sources
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