Fair Densest Subgraph Across Multiple Graphs

Published in ECML PKDD, 2024

Recommended citation: Chamalee Wickrama Arachchi and Nikolaj Tatti. (2024). "Fair Densest Subgraph Across Multiple Graphs." ECML PKDD. https://link.springer.com/chapter/10.1007/978-3-031-70362-1_1

A fairness‑aware densest subgraph formulation across multiple graph instances.

Download paper (GitHub)