Parallel Matching Algorithms

Parallel Matching Algorithms is a class of parallel algorithms designed to efficiently solve matching problems in graphs by simultaneously exploring multiple potential matches, thereby reducing computational time compared to sequential approaches.

165

Publications

6.4K

Citations

364

Authors

181

Institutions

Publications per year

2017–2026

22

Authors

364

  1. ZG
    Zvi Galil

    Tel Aviv University, Israel

    10 publications · 412 citations

    10

    h-index

  2. SP
    Serge Plotkin

    Stanford University, United States

    6 publications · 183 citations

    6

    h-index

  3. AV
    Andrew V. Goldberg

    Stanford University, United States

    5 publications · 167 citations

    5

    h-index

  4. AP
    Alex Pothen

    Purdue University West Lafayette, United States

    5 publications · 140 citations

    5

    h-index

  5. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    4 publications · 164 citations

    4

    h-index

1–5 of 364

Venues

  1. SIAM Journal on Computing

    12 publications · 349 citations

    11

    h-index

  2. Information Processing Letters

    7 publications · 469 citations

    7

    h-index

  3. arXiv (Cornell University)

    Repository · 5 publications · 103 citations

    5

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 283 citations

    4

    h-index

  5. Theoretical Computer Science

    4 publications · 123 citations

    4

    h-index

1–5