Finding hidden hamiltonian cycles
From MaRDI portal
Publication:4306372
DOI10.1002/rsa.3240050303zbMath0809.05064OpenAlexW2105806022WikidataQ57401576 ScholiaQ57401576MaRDI QIDQ4306372
Eli Shamir, Andrei Z. Broder, Alan M. Frieze
Publication date: 20 March 1995
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240050303
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Iterative algorithm for discrete structure recovery, Hidden Hamiltonian Cycle Recovery via Linear Programming, HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, On approximating the longest path in a graph, The forgetfulness of balls and bins, On a simple randomized algorithm for finding a 2-factor in sparse graphs, Hamiltonian cycle curves in the space of discounted occupational measures, Feasible Bases for a Polytope Related to the Hamilton Cycle Problem
