Matches in SemOpenAlex for { <https://semopenalex.org/work/W4382762557> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W4382762557 abstract "Even though the Hamiltonian cycle problem is NP-complete, many of its problem instances aren't. In fact, almost all the hard instances reside in one area: near the Koml'os-Szemer'edi bound, of $frac{1}{2} vcdot ln(v) + frac{1}{2} vcdot ln( ln(v))$ edges, where randomly generated graphs have an approximate 50% chance of being Hamiltonian. If the number of edges is either much higher or much lower, the problem is not hard -- most backtracking algorithms decide such instances in (near) polynomial time. Recently however, targeted search efforts have identified very hard Hamiltonian cycle problem instances very far away from the Koml'os-Szemer'edi bound. In that study, the used backtracking algorithm was Vandegriend-Culberson's, which was supposedly the most efficient of all Hamiltonian backtracking algorithms. In this paper, we make a unified large scale quantitative comparison for the best known backtracking algorithms described between 1877 and 2016. We confirm the suspicion that the Koml'os-Szemer'edi bound is a hard area for all backtracking algorithms, but also that Vandegriend-Culberson is indeed the most efficient algorithm, when expressed in consumed computing time. When measured in recursive effectiveness however, the algorithm by Frank Rubin, almost half a century old, performs best. In a more general algorithmic assessment, we conjecture that edge pruning and non-Hamiltonicity checks might be largely responsible for these recursive savings. When expressed in system time however, denser problem instances require much more time per recursion. This is most likely due to the costliness of the extra search pruning procedures, which are relatively elaborate. We supply large amounts of experimental data, and a unified single-program implementation for all six algorithms. All data and algorithmic source code is made public for further use by our colleagues." @default.
- W4382762557 created "2023-07-01" @default.
- W4382762557 creator A5012462465 @default.
- W4382762557 creator A5036800029 @default.
- W4382762557 date "2021-07-01" @default.
- W4382762557 modified "2023-09-23" @default.
- W4382762557 title "Backtracking (the) Algorithms on the Hamiltonian Cycle Problem" @default.
- W4382762557 doi "https://doi.org/10.48550/arxiv.2107.00314" @default.
- W4382762557 hasPublicationYear "2021" @default.
- W4382762557 type Work @default.
- W4382762557 citedByCount "0" @default.
- W4382762557 crossrefType "posted-content" @default.
- W4382762557 hasAuthorship W4382762557A5012462465 @default.
- W4382762557 hasAuthorship W4382762557A5036800029 @default.
- W4382762557 hasBestOaLocation W43827625571 @default.
- W4382762557 hasConcept C11413529 @default.
- W4382762557 hasConcept C114614502 @default.
- W4382762557 hasConcept C118615104 @default.
- W4382762557 hasConcept C126255220 @default.
- W4382762557 hasConcept C130787639 @default.
- W4382762557 hasConcept C132525143 @default.
- W4382762557 hasConcept C134306372 @default.
- W4382762557 hasConcept C147297375 @default.
- W4382762557 hasConcept C156884757 @default.
- W4382762557 hasConcept C2780990831 @default.
- W4382762557 hasConcept C311688 @default.
- W4382762557 hasConcept C33923547 @default.
- W4382762557 hasConcept C41008148 @default.
- W4382762557 hasConcept C77553402 @default.
- W4382762557 hasConcept C86524685 @default.
- W4382762557 hasConceptScore W4382762557C11413529 @default.
- W4382762557 hasConceptScore W4382762557C114614502 @default.
- W4382762557 hasConceptScore W4382762557C118615104 @default.
- W4382762557 hasConceptScore W4382762557C126255220 @default.
- W4382762557 hasConceptScore W4382762557C130787639 @default.
- W4382762557 hasConceptScore W4382762557C132525143 @default.
- W4382762557 hasConceptScore W4382762557C134306372 @default.
- W4382762557 hasConceptScore W4382762557C147297375 @default.
- W4382762557 hasConceptScore W4382762557C156884757 @default.
- W4382762557 hasConceptScore W4382762557C2780990831 @default.
- W4382762557 hasConceptScore W4382762557C311688 @default.
- W4382762557 hasConceptScore W4382762557C33923547 @default.
- W4382762557 hasConceptScore W4382762557C41008148 @default.
- W4382762557 hasConceptScore W4382762557C77553402 @default.
- W4382762557 hasConceptScore W4382762557C86524685 @default.
- W4382762557 hasLocation W43827625571 @default.
- W4382762557 hasOpenAccess W4382762557 @default.
- W4382762557 hasPrimaryLocation W43827625571 @default.
- W4382762557 hasRelatedWork W153926374 @default.
- W4382762557 hasRelatedWork W1572529423 @default.
- W4382762557 hasRelatedWork W1979545228 @default.
- W4382762557 hasRelatedWork W2077251859 @default.
- W4382762557 hasRelatedWork W2129394762 @default.
- W4382762557 hasRelatedWork W2383193181 @default.
- W4382762557 hasRelatedWork W2951903052 @default.
- W4382762557 hasRelatedWork W3177054231 @default.
- W4382762557 hasRelatedWork W3207412727 @default.
- W4382762557 hasRelatedWork W384763036 @default.
- W4382762557 isParatext "false" @default.
- W4382762557 isRetracted "false" @default.
- W4382762557 workType "article" @default.