Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/108868
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: Efficient computation of distance labeling for decremental updates in large dynamic graphs
Author: Qin, Y.
Sheng, Q.
Falkner, N.
Yao, L.
Parkinson, S.
Citation: World Wide Web, 2017; 20(5):915-937
Publisher: Springer
Issue Date: 2017
ISSN: 1386-145X
1573-1413
Statement of
Responsibility: 
Yongrui Qin, Quan Z. Sheng, Nickolas J.G. Falkner, Lina Yao, Simon Parkinson
Abstract: Since today’s real-world graphs, such as social network graphs, are evolving all the time, it is of great importance to perform graph computations and analysis in these dynamic graphs. Due to the fact that many applications such as social network link analysis with the existence of inactive users need to handle failed links or nodes, decremental computation and maintenance for graphs is considered a challenging problem. Shortest path computation is one of the most fundamental operations for managing and analyzing large graphs. A number of indexing methods have been proposed to answer distance queries in static graphs. Unfortunately, there is little work on answering such queries for dynamic graphs. In this paper, we focus on the problem of computing the shortest path distance in dynamic graphs, particularly on decremental updates (i.e., edge deletions). We propose maintenance algorithms based on distance labeling, which can handle decremental updates efficiently. By exploiting properties of distance labeling in original graphs, we are able to efficiently maintain distance labeling for new graphs. We experimentally evaluate our algorithms using eleven real-world large graphs and confirm the effectiveness and efficiency of our approach. More specifically, our method can speed up index re-computation by up to an order of magnitude compared with the state-of-the-art method, Pruned Landmark Labeling (PLL).
Keywords: Shortest path; graph computation; distance labeling; dynamic graph
Description: Published online: 20 October 2016
Rights: © Springer Science+Business Media New York 2016
DOI: 10.1007/s11280-016-0421-1
Appears in Collections:Aurora harvest 3
Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_108868.pdf
  Restricted Access
Restricted Access1.29 MBAdobe PDFView/Open


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