{"paper":{"title":"A Note on Logarithmic Space Stream Algorithms for Matchings in Low Arboricity Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew McGregor, Sofya Vorotnikova","submitted_at":"2016-12-08T05:15:07Z","abstract_excerpt":"We present a data stream algorithm for estimating the size of the maximum matching of a low arboricity graph. Recall that a graph has arboricity $\\alpha$ if its edges can be partitioned into at most $\\alpha$ forests and that a planar graph has arboricity $\\alpha=3$. Estimating the size of the maximum matching in such graphs has been a focus of recent data stream research.\n  A surprising result on this problem was recently proved by Cormode et al. They designed an ingenious algorithm that returned a $(22.5\\alpha+6)(1+\\epsilon)$ approximation using a single pass over the edges of the graph (orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02531","kind":"arxiv","version":3},"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"}