{"paper":{"title":"Deterministic subgraph detection in broadcast CONGEST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Janne H. Korhonen, Joel Rybicki","submitted_at":"2017-05-29T14:05:45Z","abstract_excerpt":"We present simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation:\n  -- For any constant $k$, detecting $k$-paths and trees on $k$ nodes can be done in $O(1)$ rounds.\n  -- For any constant $k$, detecting $k$-cycles and pseudotrees on $k$ nodes can be done in $O(n)$ rounds.\n  -- On $d$-degenerate graphs, cliques and $4$-cycles can be enumerated in $O(d + \\log n)$ rounds, and $5$-cycles in $O(d^2 + \\log n)$ rounds.\n  In many cases, these bounds are tight up to logarithmic factors. Moreover, we show that the algorithms for $d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10195","kind":"arxiv","version":2},"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"}