Hybrid sketching saves up to 97% space on dense graphs and 15% on sparse ones by sketching dense cores and storing sparse parts exactly, with new BalloonSketch reducing sketch sizes up to 8x.
hub
Network structure and minimum degree
2 Pith papers cite this work, alongside 1,426 external citations. Polarity classification is still indexing.
2
Pith papers citing it
1,426
external citations · Crossref
hub tools
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New enumeration algorithms for minimal removable sets in monotone systems yield O((n+m) log n) time for k-cores and O((n+m) log n)-delay for all k-core subgraphs.
citing papers explorer
-
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
Hybrid sketching saves up to 97% space on dense graphs and 15% on sparse ones by sketching dense cores and storing sparse parts exactly, with new BalloonSketch reducing sketch sizes up to 8x.
-
Fast Enumeration of Minimal Removable Sets in Monotone Systems with Application to Core Collapse Analysis
New enumeration algorithms for minimal removable sets in monotone systems yield O((n+m) log n) time for k-cores and O((n+m) log n)-delay for all k-core subgraphs.