Getting a Directed Hamilton Cycle Two Times Faster

DOI10.1017/S096354831200020XzbMath1247.05091arXiv1103.5522OpenAlexW2158796492MaRDI QIDQ2911073

Dan Vilenchik, Choongbum Lee, Benjamin Sudakov

Publication date: 12 September 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.5522

zbMATH Keywords

directed graphrandom graph processdirected Hamiltonian cycle

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Packing Directed Hamilton Cycles Online ⋮ Packing Hamilton Cycles Online

Cites Work

• Unnamed Item
• Hamilton cycles in random geometric graphs
• Birth control for giants
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Hamiltonian circuits in random graphs
• Hamilton cycles in a class of random directed graphs
• Avoiding a giant component
• Hamiltonicity thresholds in Achlioptas processes
• Avoiding small subgraphs in Achlioptas processes
• An algorithm for finding hamilton cycles in random directed graphs
• Balanced Allocations
• Almost all regular graphs are hamiltonian
• Creating a Giant Component
• On some problems of a statistical group-theory. I
• Embracing the giant component

This page was built for publication: Getting a Directed Hamilton Cycle Two Times Faster