Dynamic spanning trees for connectivity queries on fully-dynamic undirected graphs-Reference-Cited by-同舟云学术

Dynamic spanning trees for connectivity queries on fully-dynamic undirected graphs

Published:2022-07 Issue:11 Volume:15 Page:3263-3276
ISSN:2150-8097
Container-title:Proceedings of the VLDB Endowment
language:en
Short-container-title:Proc. VLDB Endow.

Author:

Chen Qing¹,Lachish Oded²,Helmer Sven¹,Böhlen Michael H.¹

Affiliation:

1. University of Zurich

2. University of London

Abstract

Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are inserted and deleted frequently. Existing work proposes data structures and algorithms with worst case guarantees. We propose a new data structure, the dynamic tree (D-tree), together with algorithms to construct and maintain it. The D-tree is the first data structure that scales to fully dynamic graphs with millions of vertices and edges and, on average, answers connectivity queries much faster than data structures with worst case guarantees.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Link

https://dl.acm.org/doi/pdf/10.14778/3551793.3551868

Reference51 articles.

1. 2021. SNAP : Stack Overflow temporal network . Retrieved October 21, 2021 from http://snap.stanford.edu/data/sx-stackoverflow.html 2021. SNAP: Stack Overflow temporal network. Retrieved October 21, 2021 from http://snap.stanford.edu/data/sx-stackoverflow.html

2. 2022. KONECT : The KONECT Project . Retrieved June 02, 2022 from http://konect.cc/statistics/diam/ 2022. KONECT: The KONECT Project. Retrieved June 02, 2022 from http://konect.cc/statistics/diam/

3. An empirical study of dynamic graph algorithms

4. Waleed Ammar , Dirk Groeneveld , Chandra Bhagavatula , Iz Beltagy , Miles Crawford , Doug Downey , Jason Dunkelberger , Ahmed Elgohary , Sergey Feldman , Vu Ha , Rodney Kinney , Sebastian Kohlmeier , Kyle Lo , Tyler Murray , Hsu-Han Ooi , Matthew Peters , Joanna Power , Sam Skjonsberg, Lucy Lu Wang, Chris Wilhelm, Zheng Yuan, Madeleine van Zuylen, and Oren Etzioni. 2018 . Construction of the Literature Graph in Semantic Scholar. In NAACL. https://www.semanticscholar.org/paper/09e3cf5704bcb16e6657f6ceed70e93373a54618 Waleed Ammar, Dirk Groeneveld, Chandra Bhagavatula, Iz Beltagy, Miles Crawford, Doug Downey, Jason Dunkelberger, Ahmed Elgohary, Sergey Feldman, Vu Ha, Rodney Kinney, Sebastian Kohlmeier, Kyle Lo, Tyler Murray, Hsu-Han Ooi, Matthew Peters, Joanna Power, Sam Skjonsberg, Lucy Lu Wang, Chris Wilhelm, Zheng Yuan, Madeleine van Zuylen, and Oren Etzioni. 2018. Construction of the Literature Graph in Semantic Scholar. In NAACL. https://www.semanticscholar.org/paper/09e3cf5704bcb16e6657f6ceed70e93373a54618

5. Incremental Maintenance of 2-Hop Labeling of Large Graphs

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Incremental Sliding Window Connectivity over Streaming Graphs;Proceedings of the VLDB Endowment;2024-06

2. On Querying Historical Connectivity in Temporal Graphs;Proceedings of the ACM on Management of Data;2024-05-29

3. Integrating Connection Search in Graph Queries;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04