Streaming Matching

Streaming Matching is a computational framework within streaming algorithms that maintains a matching in a dynamically evolving graph under the constraint of limited memory and single-pass access to edges, distinguishing itself by addressing the challenge of maximizing matching size while processing edge insertions and deletions in real-time.

34

Publications

999

Citations

74

Authors

42

Institutions

Publications per year

2017–2026

14

Authors

74

  1. MM
    Morteza Monemizadeh

    University of Warwick, United Kingdom

    5 publications · 84 citations

    5

    h-index

  2. EP
    Ely Porat

    Bar-Ilan University, Israel

    4 publications · 129 citations

    4

    h-index

  3. VL
    Vahid Liaghat

    University of Maryland, College Park, United States

    3 publications · 146 citations

    3

    h-index

  4. SK
    Sanjeev Khanna

    University of Pennsylvania, United States

    3 publications · 139 citations

    3

    h-index

  5. MH
    MohammadTaghi Hajiaghayi

    University of Maryland, College Park, United States

    2 publications · 122 citations

    2

    h-index

1–5 of 74

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 7 publications · 110 citations

    7

    h-index

  2. Information Sciences

    2 publications · 43 citations

    2

    h-index

  3. Algorithmica

    2 publications · 62 citations

    2

    h-index

  4. ACM Transactions on Algorithms

    TALG · 2 publications · 41 citations

    2

    h-index

  5. arXiv (Cornell University)

    Repository · 2 publications · 37 citations

    2

    h-index

1–5