Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study

DOI10.1016/S0020-0190(97)00222-6zbMath1338.68103MaRDI QIDQ293254

Jeremy Frank, Toby Walsh, Ian Philip Gent

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002226?np=y

zbMATH Keywords

computational complexityphase transitionsanalysis of algorithmsfinite size scalingconstrainedness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

SAT problems with chains of dependent variables ⋮ Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• The hardest constraint problems: A double phase transition
• Easy problems are sometimes hard
• The TSP phase transition
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• The main properties of random graphs with a large number of vertices and edges
• Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph