Maintaining approximate all-pair-shortest-paths under deletion

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2003) Maintaining approximate all-pair-shortest-paths under deletion ACM Proceedings - Annual Symposium on Discrete Algorithms . pp. 394-403. ISSN 1071-9040

Full text not available from this repository.

Official URL: http://dl.acm.org/event.cfm?id=RE382&tab=pubs&CFID...

Abstract

We present a hierarchical scheme for efficiently main­taining all-pairs approximate shortest-paths in undi­rected unweighted graphs under deletions of edges.

Item Type:Article
Source:Copyright of this article belongs to Association for Computing Machinery.
ID Code:90257
Deposited On:04 Jul 2012 03:17
Last Modified:04 Jul 2012 03:17

Repository Staff Only: item control page