On-line topological simplification of weighted graphs

Details On-line topological simplification of weighted graphs On-line topological simplification of weighted graphs

2006-08-23

arxiv.org/abs/cs/0608091v1

Proceedings ACM-GIS 2006, ACM Press

Computer Science

Data Structures and Algorithms

This is the full techreport corresponding to the paper "On-line maintenance of simplified weighted graphs for efficient distan

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On-line topological simplification of weighted graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On-line topological simplification of weighted graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-line topological simplification of weighted graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-339096