On-line topological simplification of weighted graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
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

Keywords

Data Structures and Algorithms, Databases

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/114847

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0608091
 http://arxiv.org/abs/cs/0608091
 Proceedings ACM-GIS 2006, ACM Press

Collections

arXiv