{"paper":{"title":"Distributed Edge Connectivity in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Mohit Daga, Monika Henzinger, Thatchaphol Saranurak","submitted_at":"2019-04-08T20:23:20Z","abstract_excerpt":"We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\\tilde O(n^{1-1/353}D^{1/353}+n^{1-1/706})$ time to compute $\\lambda$ and a cut of cardinality $\\lambda$ with high probability, where $n$ and $D$ are the number of nodes and the diameter of the network, respectively, and $\\tilde O$ hides polylogarithmic factors. This running time is sublinear in $n$ (i.e. $\\tilde O(n^{1-\\epsilon})$) whenever $D$ is. Previous sublinear-time d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04341","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"}