Go to DBLP homepageFairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance
External IDs:dblp:conf/cikm/VuongLOL25
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview