Chen, Qing and Helmer, Sven and Lachish, Oded and Bohlen, Michael (2022) Dynamic Spanning Trees for connectivity queries on fully-dynamic undirected graphs. In: 48th International Conference on Very Large Databases, 5-9 Sep 2022, Sydney, Australia.
|
Text
p-2557-chen.pdf - Published Version of Record Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Preview |
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.
Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Keyword(s) / Subject(s): | Connectivity Queries, Dynamic, Graphs |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Oded Lachish |
| Date Deposited: | 20 Mar 2023 16:57 |
| Last Modified: | 09 Aug 2023 12:53 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/48685 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
