DBScholar

Back to papers

On Querying Historical Connectivity in Temporal Graphs

Summary: Historical connectivity in evolving temporal graphs: new forest-based index for windowed reachability, replacing costly dynamic two-hop covers. Queries reduce to connectivity checks in the forest; incremental forest maintenance also supports sliding-window connectivity efficiently. (summarized by gpt-5.4-mini on May 24 2026)

Paper ID
6983
Venue
SIGMOD
Year
2024
Pagerank
5.9853864e-05
Overall Rank
6,075 | 58.33%
DOI
10.1145/3654960

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{song_sigmod24,
        title = {{On Querying Historical Connectivity in Temporal Graphs}},
        author = {Song, Jingyi and Wen, Dong and Xu, Lantian and Qin, Lu and Zhang, Wenjie and Lin, Xuemin},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3654960},
        url = {https://dl.acm.org/doi/10.1145/3654960},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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