arrow
Return

Faster Parallel Core Maintenance Algorithms in Dynamic Graphs

delete2020-06-01
delete45
PRE
AI
Q
Qiang-Sheng Hua
史
史宇亮 (Yuliang Shi)
D
Dongxiao Yu *
金
金海 (Hai Jin)
J
Jiguo Yu
成
成秀珍 (Xiuzhen Cheng)
陈
陈汉华 (Hanhua Chen)
DOI:10.1109/TPDS.2019.2960226delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This article studies the core maintenance problem for dynamic graphs which requires to update each vertex's core number with the insertion/deletion of vertices/edges. Previous algorithms can either process one edge associated with a vertex in each iteration or can only process one superior edge associated with the vertex (an edge < u, v > is a superior edge of vertex u if v' core number is no less than u's core number) in each iteration. Thus for high superior-degree vertices (the vertices associated with many superior edges) insertions/deletions, previous algorithms become very inefficient. In this article, we discovered a new structure called joint edge set whose insertions/deletions make each vertex's core number change at most one. The joint edge set mainly contains all the superior edges associated with the high superior-degree vertices as long as these vertices are 3(+)-hop independent. Based on this discovery, faster parallel algorithms are devised to solve the core maintenance problems. In our algorithms, we can process all edges in the joint edge set in one iteration and thus can greatly increase the parallelism and reduce the processing time. The results of extensive experiments conducted on various types of real-world, temporal, and synthetic graphs illustrate that the proposed algorithms achieve good efficiency, stability and scalability. Specifically, the new algorithms can outperform the single-edge processing algorithms by up to four orders of magnitude. Compared with the matching based algorithm and the superior edge based algorithm, our algorithms show a significant speedup up to 60x in the processing time.
Keywords:
Graph analysis
core maintenance problem
parallel algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Parallel and Distributed Systems cover
IEEE Transactions on Parallel and Distributed Systems
IF:
6
Papers:
5.2K
Citations:
1.1W

Organization

Q
Qilu University of Technology
Scholars:
1.1W
Papers: 8.9K
Citations: 16
U
university system of georgia
Scholars:
7.3W
Papers: 6.6W
Citations: 101
S
shandong university
Scholars:
9.5W
Papers: 6.4W
Citations: 94
researcher View more organizations
Cited Papers

Cited Papers

In vitro reconstruction of a tissue-engineered endothelialized bladder from a single porcine biopsy
err2006-08-01
err0
PREAI
errMartine Magnan; François Berthod; Marie-France Champigny; Frédéric Soucy; Stéphane Bolduc
errShare
errSave
errShare
errSave
errShare
errSave
Stimulation of Erythrocyte Membrane Blebbing by Naproxen Sodium
err2020-01-14
err0
errOAAI
errSajida Ilyas; Kashif Jilani; Muhammad Sikandar; Saba Siddiq; Muhammad Riaz; Ayesha Naveed; Ismat Bibi; Haq Nawaz; Muhammad Irfan; Asma Asghar
errShare
errSave
Reduction in Histone H3 Acetylation and Chromatin Remodeling in Corneas of Alloxan-Induced Diabetic Rats
err2018-01-30
err0
PREAI
errKarina E. Herencia-Bueno; Marcela Aldrovani; Roberta M. Crivelaro; Roberto Thiesen; Alexandre A. F. Barros-Sobrinho; Flor D. Y. Claros-Chacaltana; Ivan R. M. Padua; Daniela M. Santos; José L. Laus
errShare
errSave
Distributed k-Core Decomposition
err2013-02-01
err139
errOAAI
errMontresor, Alberto; De Pellegrini, Francesco; Miorandi, Daniele
errShare
errSave
Biosorption of copper (II) from aqueous solutions by wheat shell
err2004-04-01
err0
PREAI
errNurgul Basci; Erdem Kocadagistan; Beyhan Kocadagistan
errShare
errSave
Learning dynamic dependency network structure with time lag
err2017-08-30
err2
PREAI
errDu, Sizhen; Song, Guojie; Hong, Haikun; Liu, Dong
errShare
errSave
researcher View more