The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs

Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, Shanmugavelayutham Muthukrishnan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs. (Insert-Only Streams) We present a one-pass algorithm that takes O(α log n) space and approximates the size of the maximum matching in graphs with arboricity α within a factor of O(α). This improves significantly upon the state-of-The-Art Õ(α n2/3)-space streaming algorithms, and is the first poly-logarithmic space algorithm for this problem. (Dynamic Streams) Given a dynamic graph stream (i.e., inserts and deletes) of edges of an underlying α -bounded arboricity graph, we present an one-pass algorithm that uses space Õ(α 10/3n2/3) and returns an O(α)-estimator for the size of the maximum matching on the condition that the number edge deletions in the stream is bounded by O(α n). For this class of inputs, our algorithm improves the state-of-The-Art O (α n4/5)-space algorithms, where the O (.) notation hides logarithmic in n dependencies. In contrast to prior work, our results take more advantage of the streaming access to the input and characterize the matching size based on the ordering of the edges in the stream in addition to the degree distributions and structural properties of the sparse graphs.

    Original languageEnglish (US)
    Title of host publication25th European Symposium on Algorithms, ESA 2017
    EditorsChristian Sohler, Christian Sohler, Kirk Pruhs
    PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
    ISBN (Electronic)9783959770491
    DOIs
    StatePublished - Sep 1 2017
    Event25th European Symposium on Algorithms, ESA 2017 - Vienna, Austria
    Duration: Sep 4 2017Sep 6 2017

    Publication series

    NameLeibniz International Proceedings in Informatics, LIPIcs
    Volume87
    ISSN (Print)1868-8969

    Conference

    Conference25th European Symposium on Algorithms, ESA 2017
    CountryAustria
    CityVienna
    Period9/4/179/6/17

    Fingerprint

    Structural properties

    Keywords

    • Matching size
    • Streaming algorithms

    ASJC Scopus subject areas

    • Software

    Cite this

    Cormode, G., Jowhari, H., Monemizadeh, M., & Muthukrishnan, S. (2017). The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs. In C. Sohler, C. Sohler, & K. Pruhs (Eds.), 25th European Symposium on Algorithms, ESA 2017 [29] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 87). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.29

    The sparse awakens : Streaming algorithms for matching size estimation in sparse graphs. / Cormode, Graham; Jowhari, Hossein; Monemizadeh, Morteza; Muthukrishnan, Shanmugavelayutham.

    25th European Symposium on Algorithms, ESA 2017. ed. / Christian Sohler; Christian Sohler; Kirk Pruhs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 29 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 87).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Cormode, G, Jowhari, H, Monemizadeh, M & Muthukrishnan, S 2017, The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs. in C Sohler, C Sohler & K Pruhs (eds), 25th European Symposium on Algorithms, ESA 2017., 29, Leibniz International Proceedings in Informatics, LIPIcs, vol. 87, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25th European Symposium on Algorithms, ESA 2017, Vienna, Austria, 9/4/17. https://doi.org/10.4230/LIPIcs.ESA.2017.29
    Cormode G, Jowhari H, Monemizadeh M, Muthukrishnan S. The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs. In Sohler C, Sohler C, Pruhs K, editors, 25th European Symposium on Algorithms, ESA 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 29. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.ESA.2017.29
    Cormode, Graham ; Jowhari, Hossein ; Monemizadeh, Morteza ; Muthukrishnan, Shanmugavelayutham. / The sparse awakens : Streaming algorithms for matching size estimation in sparse graphs. 25th European Symposium on Algorithms, ESA 2017. editor / Christian Sohler ; Christian Sohler ; Kirk Pruhs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).
    @inproceedings{cb16eed5033c4cbcae983d9c0bbaa830,
    title = "The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs",
    abstract = "Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs. (Insert-Only Streams) We present a one-pass algorithm that takes O(α log n) space and approximates the size of the maximum matching in graphs with arboricity α within a factor of O(α). This improves significantly upon the state-of-The-Art {\~O}(α n2/3)-space streaming algorithms, and is the first poly-logarithmic space algorithm for this problem. (Dynamic Streams) Given a dynamic graph stream (i.e., inserts and deletes) of edges of an underlying α -bounded arboricity graph, we present an one-pass algorithm that uses space {\~O}(α 10/3n2/3) and returns an O(α)-estimator for the size of the maximum matching on the condition that the number edge deletions in the stream is bounded by O(α n). For this class of inputs, our algorithm improves the state-of-The-Art O (α n4/5)-space algorithms, where the O (.) notation hides logarithmic in n dependencies. In contrast to prior work, our results take more advantage of the streaming access to the input and characterize the matching size based on the ordering of the edges in the stream in addition to the degree distributions and structural properties of the sparse graphs.",
    keywords = "Matching size, Streaming algorithms",
    author = "Graham Cormode and Hossein Jowhari and Morteza Monemizadeh and Shanmugavelayutham Muthukrishnan",
    year = "2017",
    month = "9",
    day = "1",
    doi = "10.4230/LIPIcs.ESA.2017.29",
    language = "English (US)",
    series = "Leibniz International Proceedings in Informatics, LIPIcs",
    publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
    editor = "Christian Sohler and Christian Sohler and Kirk Pruhs",
    booktitle = "25th European Symposium on Algorithms, ESA 2017",
    address = "Germany",

    }

    TY - GEN

    T1 - The sparse awakens

    T2 - Streaming algorithms for matching size estimation in sparse graphs

    AU - Cormode, Graham

    AU - Jowhari, Hossein

    AU - Monemizadeh, Morteza

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2017/9/1

    Y1 - 2017/9/1

    N2 - Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs. (Insert-Only Streams) We present a one-pass algorithm that takes O(α log n) space and approximates the size of the maximum matching in graphs with arboricity α within a factor of O(α). This improves significantly upon the state-of-The-Art Õ(α n2/3)-space streaming algorithms, and is the first poly-logarithmic space algorithm for this problem. (Dynamic Streams) Given a dynamic graph stream (i.e., inserts and deletes) of edges of an underlying α -bounded arboricity graph, we present an one-pass algorithm that uses space Õ(α 10/3n2/3) and returns an O(α)-estimator for the size of the maximum matching on the condition that the number edge deletions in the stream is bounded by O(α n). For this class of inputs, our algorithm improves the state-of-The-Art O (α n4/5)-space algorithms, where the O (.) notation hides logarithmic in n dependencies. In contrast to prior work, our results take more advantage of the streaming access to the input and characterize the matching size based on the ordering of the edges in the stream in addition to the degree distributions and structural properties of the sparse graphs.

    AB - Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs. (Insert-Only Streams) We present a one-pass algorithm that takes O(α log n) space and approximates the size of the maximum matching in graphs with arboricity α within a factor of O(α). This improves significantly upon the state-of-The-Art Õ(α n2/3)-space streaming algorithms, and is the first poly-logarithmic space algorithm for this problem. (Dynamic Streams) Given a dynamic graph stream (i.e., inserts and deletes) of edges of an underlying α -bounded arboricity graph, we present an one-pass algorithm that uses space Õ(α 10/3n2/3) and returns an O(α)-estimator for the size of the maximum matching on the condition that the number edge deletions in the stream is bounded by O(α n). For this class of inputs, our algorithm improves the state-of-The-Art O (α n4/5)-space algorithms, where the O (.) notation hides logarithmic in n dependencies. In contrast to prior work, our results take more advantage of the streaming access to the input and characterize the matching size based on the ordering of the edges in the stream in addition to the degree distributions and structural properties of the sparse graphs.

    KW - Matching size

    KW - Streaming algorithms

    UR - http://www.scopus.com/inward/record.url?scp=85030537379&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85030537379&partnerID=8YFLogxK

    U2 - 10.4230/LIPIcs.ESA.2017.29

    DO - 10.4230/LIPIcs.ESA.2017.29

    M3 - Conference contribution

    AN - SCOPUS:85030537379

    T3 - Leibniz International Proceedings in Informatics, LIPIcs

    BT - 25th European Symposium on Algorithms, ESA 2017

    A2 - Sohler, Christian

    A2 - Sohler, Christian

    A2 - Pruhs, Kirk

    PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

    ER -