Not logged in.
Quick Search - Contribution
Contribution Details
| Type | Journal Article |
| Scope | Discipline-based scholarship |
| Title | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs |
| Organization Unit | |
| Authors |
|
| Item Subtype | Original Work |
| Refereed | Yes |
| Status | Published in final form |
| Language |
|
| Journal Title | Proceedings of the VLDB Endowment |
| Publisher | ACM Digital library |
| Geographical Reach | international |
| ISSN | 2150-8097 |
| Volume | 15 |
| Number | 11 |
| Page Range | 3263 - 3276 |
| Date | 2022 |
| Abstract Text | 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. |
| Free access at | Related URL |
| Related URLs |
|
| Digital Object Identifier | 10.14778/3551793.3551868 |
| Other Identification Number | merlin-id:23076 |
| PDF File |
Download from ZORA
|
| Export |
BibTeX
EP3 XML (ZORA)
|