Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7974
Title: On-line maintenance of simplified weighted graphs for efficient distance queries
Authors: GEERTS, Floris 
REVESZ, Peter
VAN DEN BUSSCHE, Jan 
Issue Date: 2006
Publisher: ACM
Source: Proceedings 14th ACM GIS. p. 203-210.
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.
Document URI: http://hdl.handle.net/1942/7974
Link to publication: http://doi.acm.org/10.1145/1183471.1183505
ISBN: 1-59593-529-0
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
0608091v1.pdfFull version460.79 kBAdobe PDFView/Open
Show full item record

Page view(s)

42
checked on May 20, 2022

Download(s)

160
checked on May 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.