DBScholar

Back to papers

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)

Paper ID
10690
Venue
VLDB
Year
2012
Pagerank
0.0001263063
Overall Rank
1,018 | 93.02%
DOI
10.14778/2168651.2168658

Incoming Non-self Citations Over Time

Authors

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 21 of 21 citing papers.

Rank Citing Paper Year Venue Pagerank
1,307 KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs 2020 VLDB 0.00011232263
1,416 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 0.00010839488
2,083 Fast Hierarchy Construction for Dense Subgraphs 2017 VLDB 9.1976617e-05
2,896 Online Density Bursting Subgraph Detection from Temporal Graphs 2019 VLDB 7.9828452e-05
3,613 Scaling Up k-Clique Densest Subgraph Detection 2023 SIGMOD 7.2572837e-05
3,993 Efficient k-Clique Listing: An Edge-Oriented Branching Strategy 2024 SIGMOD 6.9688824e-05
4,672 Efficient Maximum k-Defective Clique Computation with Improved Time Complexity 2023 SIGMOD 6.5731244e-05
4,903 A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery 2022 SIGMOD 6.4520708e-05
5,471 Maximum k-Plex Computation: Theory and Practice 2024 SIGMOD 6.2061433e-05
6,368 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 5.8975125e-05
7,624 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 5.5805027e-05
9,519 A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery 2024 SIGMOD 5.2562724e-05
9,540 Efficient Maximum s-Bundle Search via Local Vertex Connectivity 2025 SIGMOD 5.2528121e-05
9,696 An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery 2024 SIGMOD 5.2351259e-05
10,226 Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance 2026 SIGMOD 5.093636e-05
10,363 Efficient and Scalable Directed Densest Subgraph Discovery 2026 SIGMOD 5.093636e-05
10,790 Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum 2025 SIGMOD 5.093636e-05
10,930 Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory 2025 VLDB 5.093636e-05
11,608 Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques 2022 VLDB 5.093636e-05
12,158 ALID: Scalable Dominant Cluster Detection 2015 VLDB 5.093636e-05
13,577 StoryPivot: Comparing and Contrasting Story Evolution 2015 SIGMOD -
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
138 Discovering Large Dense Subgraphs in Massive Graphs 2005 VLDB 0.00029823423
161 Mining Frequent Patterns without Candidate Generation 2000 SIGMOD 0.00027981772
1,153 Efficient Diversity-Aware Search 2011 SIGMOD 0.0001193423
1,439 TwitterMonitor: Trend Detection over the Twitter Stream 2010 SIGMOD 0.00010778916
1,907 Incremental Clustering for Mining in a Data Warehousing Environment 1998 VLDB 9.501636e-05
2,833 Seeking Stable Clusters in the Blogosphere 2007 VLDB 8.0782625e-05
3,862 CSV: Visualizing and Mining Cohesive Subgraphs 2008 SIGMOD 7.0665158e-05
8,758 What's on the Grapevine ? 2009 SIGMOD 5.3766157e-05
Previous Page 1 / 1 Next

Semantically Similar Papers