go back
go back
Volume 15, No. 11
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs
Authors:
Qing Chen (University of Zürich)* Oded Lachish (Birkbeck, University of London) Sven Helmer (University of Zurich) Michael H Böhlen (University of Zurich)
Abstract
Answering connectivity queries is fundamental to fully-dynamic graphs where edges and vertices are inserted and deleted frequently. Existing works propose 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.
PVLDB is part of the VLDB Endowment Inc.
Privacy Policy