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.
Bioi nformatics 22(14), e150–e157 (2006)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 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.