Q-DISCO defines query-aligned densest subgraphs, shows NP-hardness, and offers Lagrangian and peeling heuristics that scale to large networks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information
Q-DISCO defines query-aligned densest subgraphs, shows NP-hardness, and offers Lagrangian and peeling heuristics that scale to large networks.