DBScholar

Back to papers

Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties

Summary: Temporal bumps: a connected subgraph and a time window that maximize PoI discrepancy in graphs with dynamic vertex properties. Proposes two approximations with trade-offs and two fast heuristics; experiments on real data show higher discrepancies and scalable performance versus baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6373
Venue
SIGMOD
Year
2022
Pagerank
5.44244e-05
Overall Rank
8,365 | 42.61%
DOI
10.1145/3514221.3517859

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{sun_sigmod22,
        title = {{Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties}},
        author = {Sun, Yahui and Ma, Shuai and Cui, Bin},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3517859},
        url = {https://dl.acm.org/doi/10.1145/3514221.3517859},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 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.

Previous Page 1 / 1 Next

Semantically Similar Papers