On-line topological simplification of weighted graphs
Data Structures and Algorithms
2007-05-23 v1 Databases
Abstract
We describe two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line in that they react to updates on the data, keeping the simplification up-to-date. The supported updates are insertions of vertices and edges; hence, our algorithms are partially dynamic. We provide both analytical and empirical evaluations of the efficiency of our approaches. Specifically, we prove an O(log n) upper bound on the amortized time complexity of our maintenance algorithms, with n the number of insertions.
Keywords
Cite
@article{arxiv.cs/0608091,
title = {On-line topological simplification of weighted graphs},
author = {Floris Geerts and Peter Revesz and Jan Van den Bussche},
journal= {arXiv preprint arXiv:cs/0608091},
year = {2007}
}
Comments
This is the full techreport corresponding to the paper "On-line maintenance of simplified weighted graphs for efficient distance queries" in the proceedings of ACM-GIS 2006