Graph Sparsification

Graph sparsification is a graph compression technique that produces a sparse subgraph or reweighted graph with significantly fewer edges while preserving key structural properties of the original graph, such as cut values, spectral characteristics, or shortest path distances, within a guaranteed approximation bound.

288

Publications

18.2K

Citations

588

Authors

297

Institutions

Publications per year

2017–2026

90

Authors

588

  1. ZF
    Zhuo Feng

    Michigan Technological University, United States

    12 publications · 226 citations

    11

    h-index

  2. DA
    Daniel A. Spielman

    Yale University, United States

    11 publications · 2.9K citations

    11

    h-index

  3. RP
    Richard Peng

    Georgia Institute of Technology, United States

    9 publications · 358 citations

    9

    h-index

  4. IK
    Ioannis Koutis

    Carnegie Mellon University, United States

    7 publications · 323 citations

    7

    h-index

  5. MK
    Michael Kapralov

    Stanford University, United States

    7 publications · 250 citations

    7

    h-index

1–5 of 588

Venues

  1. arXiv (Cornell University)

    Repository · 27 publications · 817 citations

    17

    h-index

  2. SIAM Journal on Computing

    13 publications · 1.7K citations

    12

    h-index

  3. SIAM Journal on Discrete Mathematics

    8 publications · 278 citations

    8

    h-index

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

    Repository · 7 publications · 130 citations

    7

    h-index

  5. ACM Transactions on Algorithms

    TALG · 6 publications · 194 citations

    6

    h-index

1–5