The thesis gives the first non-trivial dual fault-tolerant pairwise reachability preservers of size O(n^{4/3}|P|^{1/3}) and new approximation algorithms plus a streaming method for fair clustering in graphs.
Guarantees for spectral clustering with fairness constraints , booktitle =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Creating Robust and Fair Graph Structures for Connectivity and Clustering
The thesis gives the first non-trivial dual fault-tolerant pairwise reachability preservers of size O(n^{4/3}|P|^{1/3}) and new approximation algorithms plus a streaming method for fair clustering in graphs.