On the public citation graph
An algorithm for finding hamilton paths and cycles in random graphs
0 signed · 106 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02066689openalex-snapshot
On the strength of connectedness of a random graph
inferredcites →https://doi.org/10.1007/bf02579348openalex-snapshot
How many random edges make a graph hamiltonian?
inferredcites →https://doi.org/10.1016/0012-365x(83)90021-3openalex-snapshot
Limit distribution for the existence of hamiltonian cycles in a random graph
inferredcites →https://doi.org/10.1016/0012-365x(83)90046-8openalex-snapshot
On the existence of Hamiltonian cycles in a class of random graphs
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/s0195-6698(83)80039-0openalex-snapshot
Almost all Regular Graphs are Hamiltonian
inferredcites →https://doi.org/10.1016/s0195-6698(85)80046-9openalex-snapshot
Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73611-9openalex-snapshot
On Matchings and Hamiltonian Cycles in Random Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0160openalex-snapshot
Combinatorial Traveling Salesman Problem Algorithms
inferred← citeshttps://doi.org/10.1002/jgt.10065openalex-snapshot
Sparse pseudo‐random graphs are Hamiltonian
inferred← citeshttps://doi.org/10.1002/rsa.20151openalex-snapshot
The cover time of sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20302openalex-snapshot
Hamiltonicity thresholds in Achlioptas processes
inferred← citeshttps://doi.org/10.1002/rsa.20435openalex-snapshot
Longest cycles in sparse random digraphs
inferred← citeshttps://doi.org/10.1002/rsa.20455openalex-snapshot
On covering expander graphs by hamilton cycles
inferred← citeshttps://doi.org/10.1002/rsa.20482openalex-snapshot
On a greedy 2‐matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
inferred← citeshttps://doi.org/10.1002/rsa.20519openalex-snapshot
Tight Hamilton cycles in random hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.20542openalex-snapshot
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
inferred← citeshttps://doi.org/10.1002/rsa.20832openalex-snapshot
Traveling in randomly embedded random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20918openalex-snapshot
Finding a Hamilton cycle fast on average using rotations and extensions
inferred← citeshttps://doi.org/10.1002/rsa.21286openalex-snapshot
The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240050303openalex-snapshot
Finding hidden hamiltonian cycles
inferred← citeshttps://doi.org/10.1002/rsa.70027openalex-snapshot
Sequentially Constrained Hamilton Cycles in Random Graphs
inferred← citeshttps://doi.org/10.1007/11527954_7openalex-snapshot
A Distributed Algorithm to Find Hamiltonian Cycles in $\mathcal{G}(n, p)$ Random Graphs
inferred← citeshttps://doi.org/10.1007/11602613_50openalex-snapshot
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_11openalex-snapshot
A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in $$O(\log n)$$ Time
inferred← citeshttps://doi.org/10.1007/978-3-030-34405-4_5openalex-snapshot
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography
inferred← citeshttps://doi.org/10.1007/978-3-030-93954-0_8-1openalex-snapshot
Network Visualization: Graph Theory Meets Geometry, Topology, and Design
inferred← citeshttps://doi.org/10.1007/978-3-319-39817-4_19openalex-snapshot
Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_11openalex-snapshot
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs
inferred← citeshttps://doi.org/10.1007/978-3-319-73013-4_28openalex-snapshot
Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_3openalex-snapshot
Finding Tight Hamilton Cycles in Random Hypergraphs Faster
inferred← citeshttps://doi.org/10.1007/978-3-642-13182-0_20openalex-snapshot
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-29578-2_12openalex-snapshot
A Heuristic Algorithm for Finding Edge Disjoint Cycles in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_2openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_11openalex-snapshot
Probabilistic Analysis of Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-009-1606-7_11openalex-snapshot
An Integer Linear Programming Algorithm Polynomial in the Average Case
inferred← citeshttps://doi.org/10.1007/bf01882200openalex-snapshot
Hitting time fork edge-disjoint spanning trees in a random graph
inferred← citeshttps://doi.org/10.1007/bfb0019429openalex-snapshot
Testing hereditary properties efficiently on average
inferred← citeshttps://doi.org/10.1007/s00493-009-2362-0openalex-snapshot
Hamilton cycles in highly connected and expanding graphs
inferred← citeshttps://doi.org/10.1007/s10255-011-0091-9openalex-snapshot
Potential distribution on random electrical networks
inferred← citeshttps://doi.org/10.1007/s10479-015-2030-2openalex-snapshot
Hamiltonian cycle curves in the space of discounted occupational measures
inferred← citeshttps://doi.org/10.1007/s11227-024-06146-1openalex-snapshot
Ant Mill: an adversarial traffic pattern for low-diameter direct networks
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90100-3openalex-snapshot
A simple linear expected time algorithm for finding a hamilton path
inferred← citeshttps://doi.org/10.1016/j.adhoc.2015.12.003openalex-snapshot
Optimized bi-connected federation of multiple sensor network segments
inferred← citeshttps://doi.org/10.1016/j.aim.2024.109984openalex-snapshot
Hamilton cycles in pseudorandom graphs
inferred← citeshttps://doi.org/10.1016/j.automatica.2011.08.032openalex-snapshot
Quantized consensus in Hamiltonian graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.01.014openalex-snapshot
Geodesic cycles in random graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115437openalex-snapshot
Spectral radius and Hamiltonicity in generalized split graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.080openalex-snapshot
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.1016/j.sysarc.2005.09.003openalex-snapshot
High-performance adaptive routing for networks with arbitrary topology
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.001openalex-snapshot
Many hard examples in exact phase transitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.020openalex-snapshot
A distributed algorithm for finding Hamiltonian cycles in random graphs in O ( log n ) time
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115180openalex-snapshot
A signature scheme constructed from zero knowledge argument of knowledge for the subgraph isomorphism problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00464-2openalex-snapshot
Hamilton cycles in random subgraphs of pseudo-random graphs
inferred← citeshttps://doi.org/10.1016/s0096-3003(97)10166-7openalex-snapshot
Elements of a theory of computer simulation I: Sequential CA over random graphs
inferred← citeshttps://doi.org/10.1017/9781108332699.003openalex-snapshot
Large-scale structures in random graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548320000450openalex-snapshot
Finding tight Hamilton cycles in random hypergraphs faster
inferred← citeshttps://doi.org/10.1109/4234.725226openalex-snapshot
Balancing workload and recovery load on distributed fault-tolerant VOD systems
inferred← citeshttps://doi.org/10.1109/cec.2007.4424821openalex-snapshot
A Memetic Algorithm configured via a problem solving environment for the Hamiltonian Cycle problems
inferred← citeshttps://doi.org/10.1109/cec.2008.4630841openalex-snapshot
Hybrid genetic models based on recombination of allele permutations based on shift and rotations for DHCP
inferred← citeshttps://doi.org/10.1109/cis.2013.129openalex-snapshot
An Intelligent Algorithm for the (1,2,2)-Generalized Knight's Tour Problem
inferred← citeshttps://doi.org/10.1109/foci.2007.372178openalex-snapshot
A Genetic Algorithm Based on Stochastic Crossover for DHCP
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00091openalex-snapshot
Solving the Hamilton cycle problem fast on average
inferred← citeshttps://doi.org/10.1109/fuzzy.2009.5277184openalex-snapshot
On hybrid genetic models for hard problems
inferred← citeshttps://doi.org/10.1109/icdcs.2018.00079openalex-snapshot
Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213132openalex-snapshot
A low cost fault tolerant packet routing for parallel computers
inferred← citeshttps://doi.org/10.1109/jiot.2017.2772318openalex-snapshot
Energy-Efficient Mobile Charging for Wireless Power Transfer in Internet of Things Networks
inferred← citeshttps://doi.org/10.1109/seeda-cecnsm49515.2020.9221815openalex-snapshot
One Dimensional Cross-Correlation Methods For Deterministic And Stochastic Graph Signals With A Twitter Application In Julia
inferred← citeshttps://doi.org/10.1109/tvcg.2018.2808489openalex-snapshot
ColorMapND: A Data-Driven Approach and Tool for Mapping Multivariate Data to Color
inferred← citeshttps://doi.org/10.1117/12.2262052openalex-snapshot
S-TSP: a novel routing algorithm for In-network processing of recursive computation in wireless sensor networks
inferred← citeshttps://doi.org/10.1134/s1990478917030061openalex-snapshot
An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch88openalex-snapshot
Fast algorithms for solving the Hamilton Cycle problem with high probability
inferred← citeshttps://doi.org/10.1137/120871729openalex-snapshot
On Pósa's Conjecture for Random Graphs
inferred← citeshttps://doi.org/10.1137/120884316openalex-snapshot
On the Number of Hamilton Cycles in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1137/s0097539791224030openalex-snapshot
The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
inferred← citeshttps://doi.org/10.1145/103418.103442openalex-snapshot
Finding hidden Hamiltonian cycles
inferred← citeshttps://doi.org/10.1145/165231.165260openalex-snapshot
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
inferred← citeshttps://doi.org/10.1145/225058.225125openalex-snapshot
On the Fourier spectrum of monotone functions
inferred← citeshttps://doi.org/10.1155/2018/9328103openalex-snapshot
HybridHAM: A Novel Hybrid Heuristic for Finding Hamiltonian Cycle
inferred← citeshttps://doi.org/10.11606/t.55.2020.tde-10062020-100009openalex-snapshot
Exploring chaotic time series and phase spaces
inferred← citeshttps://doi.org/10.1186/s40064-016-2746-8openalex-snapshot
Efficient solution for finding Hamilton cycles in undirected graphs
inferred← citeshttps://doi.org/10.1561/9781601980892openalex-snapshot
Controlled Markov Chains, Graphs, and Hamiltonicity
inferred← citeshttps://doi.org/10.1613/jair.3109openalex-snapshot
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.1613/jair.512openalex-snapshot
The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-8openalex-snapshot
Finding Hamilton cycles in random intersection graphs
inferred← citeshttps://doi.org/10.3390/informatics6020016openalex-snapshot
RadViz++: Improvements on Radial-Based Visualizations
inferred← citeshttps://doi.org/10.3390/pr5040075openalex-snapshot
RadViz Deluxe: An Attribute-Aware Display for Multivariate Data
inferred← citeshttps://doi.org/10.37236/10237openalex-snapshot
Typical Values of Extremal-Weight Combinatorial Structures with Independent Symmetric Weights
inferred← citeshttps://doi.org/10.4018/978-1-4666-2661-4.ch008openalex-snapshot
Hamiltonian Paths and Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03136openalex-snapshot
A practical efficient and effective method for the Hamiltonian cycle problem that runs on a standard computer
inferred← citeshttps://doi.org/10.48550/arxiv.1812.01637openalex-snapshot
Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07139openalex-snapshot
Hamilton Cycles in Random Graphs: a bibliography
inferred← citeshttps://doi.org/10.48550/arxiv.2012.02551openalex-snapshot
An O(n) time algorithm for finding Hamilton cycles with high probability
inferred← citeshttps://doi.org/10.48550/arxiv.2107.00314openalex-snapshot
Backtracking (the) Algorithms on the Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0302001openalex-snapshot
Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances
inferred← citeshttps://doi.org/10.48550/arxiv.math/0210113openalex-snapshot
H-admissible permutations and the HCP
inferred← citeshttps://doi.org/10.48550/arxiv.math/0210147openalex-snapshot
Obtaining hamilton cicuits in graphs and digraphs
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-068openalex-snapshot
Hamilton cycles in pseudorandom graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.