Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/603
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGEERTS, Floris-
dc.contributor.authorREVESZ, Peter-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2005-02-15T12:38:34Z-
dc.date.available2005-02-15T12:38:34Z-
dc.date.issued2000-
dc.identifier.urihttp://hdl.handle.net/1942/603-
dc.description.abstractWe describe an efficient on-line algorithm to simplify network-like data with the goal of speeding up path queries on these data. Our algorithm is on-line in that it reacts to updates on the data, keeping the simplification up-to-date. The supported updates are insertions of vertices and edges; hence, our algorithm is semi-dynamic. We provide both analytical and empirical evaluations of the efficiency of our approach. Specifically, we prove an 0(log m) upper bound on the amortized time complexity of our maintenance algorithm, with m the number of edges. We also show that the overhead due to maintenance is negligible using real data, and illustrate the improved performance on shortest path queries over the same data.-
dc.format.extent330974 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.titleEfficient on-line topological simplification of network-like data-
dc.typePreprint-
local.bibliographicCitation.jcatO-
dc.bibliographicCitation.oldjcat-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorREVESZ, Peter-
item.contributorGEERTS, Floris-
item.accessRightsOpen Access-
item.fullcitationGEERTS, Floris; REVESZ, Peter & VAN DEN BUSSCHE, Jan (2000) Efficient on-line topological simplification of network-like data.-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
simplify.pdf323.22 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check


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