The authors prove that two fairness-constrained variants of the densest subgraph problem over graph snapshots are NP-hard and give integer-programming and greedy algorithms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fair densest subgraph across multiple graphs
The authors prove that two fairness-constrained variants of the densest subgraph problem over graph snapshots are NP-hard and give integer-programming and greedy algorithms.