FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance

FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance

31 October 2025

Minh Phu Vuong

Young-Ju Lee

Iván Ojeda-Ruiz

Chul-Ho Lee

ArXiv (abs)PDF HTML

Papers citing "FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance"

0 / 0 papers shown

Title
No papers found