Expected Computation Time for Hamiltonian Path problem
Abstract
One way to cope with an NP-hard problem is to find an algorithm that is fact on average with respect to a natural probability distribution on inputs. We consider from that point of view the Hamiltonian Path Problem. Our algorithm for the Hamiltonian Path Problem constructs or establishes the nonexistence of a Hamiltonian path. For a fixed probability p, the expected run-time of our algorithm on a random graph with n vertices and the edge probability p is $O(n)$. The algorithm is adaptable to directed graphs.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
D. Angluin, L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci., 18 (1979), 155–193
2.
Richard Bellman, Combinatorial processes and dynamic programmingProc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, 217–249
3.
B. Bollobas, Graph theory, Graduate Texts in Mathematics, Vol. 63, Springer-Verlag, New York, 1979x+180, Berlin
4.
B. Bollobas, T. I. Fenner, A. M. Frieze, An algorithm for finding Hamilton cycles in a random graph, Proc. 17th Annual ACM Symposium on Theory of Computing, 1985, 430–439
5.
Herman Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statistics, 23 (1952), 493–507
6.
Paul Erdös, Joel Spencer, Probabilistic methods in combinatorics, Academic Press [A subsidiary of Harcourt Brace Jovanovich, Publishers], New York-London, 1974, 106–
7.
Michael R. Garey, David S. Johnson, Computers and intractability, W. H. Freeman and Co., San Francisco, Calif., 1979x+338
8.
R. L. Graham, Applications of the FKG inequality and its relativesMathematical programming: the state of the art (Bonn, 1982), Springer, Berlin, 1983, 115–131, New York
9.
Y. Gurevich, S. Shelah, Expected computation time for Hamiltonian Path Problem and clique problem, Tech. Report, CRL-TR-50-84, Univ. of Michigan, Ann Arbor, 1984
10.
Michael Held, Richard M. Karp, A dynamic programming approach to sequencing problems, J. Soc. Indust. Appl. Math., 10 (1962), 196–210
11.
David S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms, 5 (1984), 284–299
12.
L. Levin, Problems, complete in “average” instance, Proc. 16th Annual ACM Symposium on Theory of Computing, 1984, 465–
13.
L. Posa, Hamiltonian circuits in random graphs, Discrete Math., 14 (1976), 359–364
14.
Walter J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System. Sci., 4 (1970), 177–192
15.
Eli Shamir, How many random edges make a graph Hamiltonian?, Combinatorica, 3 (1983), 123–131
Information & Authors
Information
Published In
Copyright
Copyright © 1987 Society for Industrial and Applied Mathematics.
History
Submitted: 27 June 1985
Accepted: 26 July 1986
Published online: 13 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- An Adaptive Hybrid Quantum Algorithm for the Metric Traveling Salesman Problem2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS) | 1 May 2023
- A 3/2-Approximation for the Metric Many-Visits Path TSPSIAM Journal on Discrete Mathematics, Vol. 36, No. 4 | 8 December 2022
- Solving the Hamilton cycle problem fast on average2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2022
- Many-visits TSP revisitedJournal of Computer and System Sciences, Vol. 124 | 1 Mar 2022
- Papers and AlgorithmsFeedback Arc Set | 10 July 2022
- Complexity and mission computability of adaptive computing systemsThe Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, Vol. 19, No. 1 | 2 September 2019
- Average-case hardness of NP from exponential worst-case hardness assumptionsProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 15 June 2021
- Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search treesComputers & Operations Research, Vol. 128 | 1 Apr 2021
- Activity Organization Queries for Location-Aware Heterogeneous Information NetworkDatabase Systems for Advanced Applications. DASFAA 2021 International Workshops | 6 April 2021
- Human Identification System Based on Latent FingerprintCommunication and Intelligent Systems | 29 June 2021
- Adaptive autonomous UAV scouting for rice lodging assessment using edge computing with deep learning EDANetComputers and Electronics in Agriculture, Vol. 179 | 1 Dec 2020
- Finding a Hamilton cycle fast on average using rotations and extensionsRandom Structures & Algorithms, Vol. 57, No. 1 | 16 March 2020
- Time- and Space-optimal Algorithm for the Many-visits TSPACM Transactions on Algorithms, Vol. 16, No. 3 | 6 June 2020
- Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplicationProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 6 June 2020
- Amoeba-inspired combinatorial optimization machinesJapanese Journal of Applied Physics, Vol. 59, No. 6 | 12 May 2020
- Towards Approximate Sphere Packing Solutions Using Distance Transformations and Dynamic LogicAdvances in Computer Vision | 24 April 2019
- Traveling in randomly embedded random graphsRandom Structures & Algorithms, Vol. 55, No. 3 | 14 December 2018
- When polynomial approximation meets exact computationAnnals of Operations Research, Vol. 271, No. 1 | 30 July 2018
- Remarkable problem-solving ability of unicellular amoeboid organism and its mechanismRoyal Society Open Science, Vol. 5, No. 12 | 19 December 2018
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problemTheoretical Computer Science, Vol. 745 | 1 Oct 2018
- An Average Case NP-complete Graph Colouring ProblemCombinatorics, Probability and Computing, Vol. 27, No. 5 | 2 April 2018
- Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman ProblemIEICE Transactions on Information and Systems, Vol. E101.D, No. 3 | 1 Jan 2018
- Large-scale structures in random graphsSurveys in Combinatorics 2017 | 30 Jun 2017
- An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 GraphsJournal of Information Processing, Vol. 25, No. 0 | 1 Jan 2017
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 GraphsDiscrete and Computational Geometry and Graphs | 24 November 2016
- When polynomial approximation meets exact computation4OR, Vol. 13, No. 3 | 8 July 2015
- Spy: A QoS-Aware Anonymous Multi-Cloud Storage System Supporting DSSE2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing | 1 May 2015
- APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIMEInternational Journal of Foundations of Computer Science, Vol. 25, No. 01 | 28 April 2014
- Exponential approximation schemata for some network design problemsJournal of Discrete Algorithms, Vol. 22 | 1 Sep 2013
- Computing Optimal Steiner Trees in Polynomial SpaceAlgorithmica, Vol. 65, No. 3 | 19 January 2012
- Finding, Minimizing, and Counting Weighted SubgraphsSIAM Journal on Computing, Vol. 42, No. 3 | 14 May 2013
- On the Encoding Invariance of Polynomial Time Computable Distribution EnsemblesComputer Science – Theory and Applications | 1 Jan 2013
- Assembly Algorithms for Deep Sequencing Data: Basics and PitfallsDeep Sequencing Data Analysis | 18 June 2013
- On exact algorithms for treewidthACM Transactions on Algorithms, Vol. 9, No. 1 | 1 Dec 2012
- A Note on Exact Algorithms for Vertex Ordering Problems on GraphsTheory of Computing Systems, Vol. 50, No. 3 | 21 January 2011
- Bandwidth and distortion revisitedDiscrete Applied Mathematics, Vol. 160, No. 4-5 | 1 Mar 2012
- Hamiltonian Paths in Some Classes of Grid GraphsJournal of Applied Mathematics, Vol. 2012 | 1 Jan 2012
- Evaluation of permanents in rings and semiringsInformation Processing Letters, Vol. 110, No. 20 | 1 Sep 2010
- Sublinear time algorithms in the theory of groups and semigroupsIllinois Journal of Mathematics, Vol. 54, No. 1 | 1 Jan 2010
- Time Versus SpaceExact Exponential Algorithms | 25 October 2010
- Exponential-time approximation of weighted set coverInformation Processing Letters, Vol. 109, No. 16 | 1 Jul 2009
- Counting Paths and Packings in HalvesAlgorithms - ESA 2009 | 1 Jan 2009
- Exact Algorithms for Exact Satisfiability and Number of Perfect MatchingsAlgorithmica, Vol. 52, No. 2 | 14 December 2007
- Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAGInformation Processing Letters, Vol. 104, No. 2 | 1 Oct 2007
- Exact Algorithms for Exact Satisfiability and Number of Perfect MatchingsAutomata, Languages and Programming | 1 Jan 2006
- On Exact Algorithms for TreewidthAlgorithms – ESA 2006 | 1 Jan 2006
- A Distributed Algorithm to Find Hamiltonian Cycles in $\mathcal{G}(n, p)$ Random GraphsCombinatorial and Algorithmic Aspects of Networking | 1 Jan 2005
- Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection GraphsAlgorithms and Computation | 1 Jan 2005
- Average-case intractability vs. worst-case intractabilityInformation and Computation, Vol. 190, No. 1 | 1 Apr 2004
- Worst-case time bounds for coloring and satisfiability problemsJournal of Algorithms, Vol. 45, No. 2 | 1 Nov 2002
- Distributional Word Problem for GroupsSIAM Journal on Computing, Vol. 28, No. 4 | 28 July 2006
- Probabilistic Analysis of AlgorithmsProbabilistic Methods for Algorithmic Discrete Mathematics | 1 Jan 1998
- The Random Adversary: A Lower-Bound Technique for Randomized Parallel AlgorithmsSIAM Journal on Computing, Vol. 26, No. 6 | 28 July 2006
- No NP problems averaging over ranking of distributions are harderTheoretical Computer Science, Vol. 181, No. 2 | 1 Jul 1997
- Average-Case Computational Complexity TheoryComplexity Theory Retrospective II | 1 Jan 1997
- Average-Case Intractable NP ProblemsAdvances in Algorithms, Languages, and Complexity | 1 Jan 1997
- Reductions and convergence rates of average timeComputing and Combinatorics | 4 June 2005
- An Integer Linear Programming Algorithm Polynomial in the Average CaseDiscrete Analysis and Operations Research | 1 Jan 1996
- Some properties of sets tractable under every polynomial-time computable distributionInformation Processing Letters, Vol. 55, No. 4 | 1 Aug 1995
- Matrix Transformation Is Complete for the Average CaseSIAM Journal on Computing, Vol. 24, No. 1 | 31 July 2006
- Rankable distributions do not provide harder instances than uniform distributionsComputing and Combinatorics | 20 June 2005
- The impact of model theory on theoretical computer scienceLogic, Methodology and Philosophy of Science IX, Proceedings of the Ninth International Congress of Logic, Methodology and Philosophy of Science | 1 Jan 1995
- Finding hidden hamiltonian cyclesRandom Structures & Algorithms, Vol. 5, No. 3 | 11 October 2006
- Randomizing Reductions of Search ProblemsSIAM Journal on Computing, Vol. 22, No. 5 | 31 July 2006
- Inclusion and exclusion algorithm for the Hamiltonian path problemInformation Processing Letters, Vol. 47, No. 4 | 1 Sep 1993
- Lightnets: topologies for high-speed optical networksJournal of Lightwave Technology, Vol. 11, No. 5 | 1 May 1993
- Average case completenessJournal of Computer and System Sciences, Vol. 42, No. 3 | 1 Jun 1991
- Updating the hamiltonian problem—A surveyJournal of Graph Theory, Vol. 15, No. 2 | 5 October 2006
- Average case complexityAutomata, Languages and Programming | 8 June 2005
- A simple linear expected time algorithm for finding a hamilton pathDiscrete Mathematics, Vol. 75, No. 1-3 | 1 May 1989
- On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer CoefficientsSIAM Journal on Computing, Vol. 16, No. 6 | 13 July 2006
- Faster Steiner Tree Computation in Polynomial-SpaceAlgorithms - ESA 2008
- Hamiltonian(t)-an ant-inspired heuristic for recognizing Hamiltonian graphsProceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
- Lightnet: lightpath based solutions for wide bandwidth WANsProceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration