Graph Sketches
Graph Sketches is a compact probabilistic data structure that summarizes the topology of a graph in a space-efficient manner, enabling approximate queries about vertex connectivity, neighborhood, and subgraph patterns while minimizing storage and computational overhead.
52
Publications
6.2K
Citations
120
Authors
61
Institutions
Publications per year
2017–2026
10
52
An algorithm for drawing general undirected graphs
Tomihisa Kamada, Satoru Kawai · Information Processing Letters · 1989 · 2.8K citations
Algorithms for drawing graphs: an annotated bibliography
Giuseppe Di Battista, Peter Eades, Roberto Tamassia et al. · Computational Geometry · 1994 · 860 citations
Kook Jin Ahn, Sudipto Guha, Andrew McGregor · 2012 · 223 citations
1–5 of 52
120
5
h-index
5
h-index
5
h-index
3
h-index
3
h-index
1–5 of 120
61
IBM (United States)
Armonk, United States
4 h-index
4 publications
178 citations

University of Massachusetts Amherst
Amherst Center, United States
4 h-index
5 publications
593 citations
University of Pennsylvania
Philadelphia, United States
4 h-index
6 publications
974 citations
Nanyang Technological University
Singapore, Singapore
3 h-index
3 publications
53 citations
Microsoft (United States)
Redmond, United States
3 h-index
8 publications
494 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
188 citations
AT&T (United States)
Bedminster, United States
2 h-index
4 publications
200 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
102 citations
1–8 of 61
Repository · 4 publications · 62 citations
4
h-index
PVLDB · 3 publications · 175 citations
3
h-index
TKDE · 2 publications · 87 citations
2
h-index
2 publications · 105 citations
2
h-index
1 publications · 25 citations
1
h-index
1–5