BD-Index answers (α,β)-dense subgraph queries in a bipartite graph in O(|D|) optimal time using O(|E|) space, with two dynamic maintenance strategies costing O(p·|E|^1.5) and O(p·|E|) per update.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal $(\alpha,\beta)$-Dense Subgraph Search in Bipartite Graphs
BD-Index answers (α,β)-dense subgraph queries in a bipartite graph in O(|D|) optimal time using O(|E|) space, with two dynamic maintenance strategies costing O(p·|E|^1.5) and O(p·|E|) per update.