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
288
Paolo Boldi, Sebastiano Vigna · 2004 · 1.2K citations
Paolo Boldi, Marco Rosa, Massimo Santini et al. · 2011 · 606 citations
On sparse spanners of weighted graphs
Ingo Althöfer, Gautam Das, David Dobkin et al. · Discrete & Computational Geometry · 1993 · 600 citations · Full text
Vertex-to-vertex pursuit in a graph
Richard J. Nowakowski, Peter Winkler · Discrete Mathematics · 1983 · 600 citations
1–5 of 288
588
11
h-index
11
h-index
9
h-index
7
h-index
7
h-index
1–5 of 588
297
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
32 publications
2.3K citations
Carnegie Mellon University
Pittsburgh, United States
12 h-index
27 publications
886 citations
Princeton University
Princeton, United States
10 h-index
21 publications
1.4K citations
Stanford University
Stanford, United States
10 h-index
16 publications
1.2K citations
Michigan Technological University
Houghton, United States
9 h-index
21 publications
356 citations
Georgia Institute of Technology
Atlanta, United States
7 h-index
15 publications
406 citations
University of California, Berkeley
Berkeley, United States
7 h-index
14 publications
337 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
12 publications
323 citations
1–8 of 297
Repository · 27 publications · 817 citations
17
h-index
13 publications · 1.7K citations
12
h-index
8 publications · 278 citations
8
h-index
Repository · 7 publications · 130 citations
7
h-index
TALG · 6 publications · 194 citations
6
h-index
1–5