{"paper":{"title":"Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gopal Pandurangan, Nguyen Dinh Pham, Reza Fathi, Soumyottam Chatterjee","submitted_at":"2018-04-24T02:45:19Z","abstract_excerpt":"We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we present a randomized distributed algorithm for the $G(n,p)$ random graph model, with number of nodes $n$ and $p=\\frac{c\\ln n}{n^{\\delta}}$ (for any constant $0 < \\delta \\leq 1$ and for a suitably large constant $c > 0$), that finds a Hamiltonian cycle with high probability in $\\tilde{O}(n^{\\delta})$ rounds (the notation $\\tilde{O}$ hides a $\\text{polylog}(n)$ factor). Our algorithm works in the (synchronous) CONGEST model (i.e., only $O(\\log n)$-sized messages are comm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08819","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}