Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification
Summary: Maintaining dense subgraphs under streaming edge-weight updates for real-time story identification. DYN DENS exploits tight bounds on edge-update impact to density, outperforming naive baselines with validation on large real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Albert Angel (University of Toronto)
- 2. Nick Koudas (University of Toronto)
- 3. Nikos Sarkas (University of Toronto)
- 4. Divesh Srivastava (AT&T)
BibTeX Citation
@article{angel_vldb12,
title = {{Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification}},
author = {Angel, Albert and Koudas, Nick and Sarkas, Nikos and Srivastava, Divesh},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {6},
pages = {574--585},
doi = {10.14778/2168651.2168658},
url = {https://doi.org/10.14778/2168651.2168658},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 130 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.0003029792 |
| 165 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027323925 |
| 1,146 | Efficient Diversity-Aware Search | 2011 | SIGMOD | 0.00011779564 |
| 1,486 | TwitterMonitor: Trend Detection over the Twitter Stream | 2010 | SIGMOD | 0.00010497457 |
| 1,948 | Incremental Clustering for Mining in a Data Warehousing Environment | 1998 | VLDB | 9.30382e-05 |
| 2,898 | Seeking Stable Clusters in the Blogosphere | 2007 | VLDB | 7.8834676e-05 |
| 3,903 | CSV: Visualizing and Mining Cohesive Subgraphs | 2008 | SIGMOD | 6.9150978e-05 |
| 8,949 | What's on the Grapevine ? | 2009 | SIGMOD | 5.2361195e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 580 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB |
| 2 | 10,684 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 3 | 2,873 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 4 | 10,291 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 5 | 560 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB |
| 6 | 3,778 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 7 | 10,630 | Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings | 2026 | SIGMOD |
| 8 | 10,636 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 9 | 4,323 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |
| 10 | 7,444 | Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments | 2012 | VLDB |