Core Maintenance in Dynamic Graphs: A Parallel Approach Based on Matching

The core number of vertices is a basic index depicting cohesiveness of a graph, and has been widely used in large-scale graph analytics. In this paper, we study the update of core numbers of vertices in dynamic graphs with edge insertions/deletions, which is known as the core maintenance problem. Di...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems 2018-11, Vol.29 (11), p.2416-2428
Main Authors:	Jin, Hai, Wang, Na, Yu, Dongxiao, Hua, Qiang-Sheng, Shi, Xuanhua, Xie, Xia
Format:	Article
Language:	English
Subjects:	Algorithms core number maintenance Deletion dynamic graph Graph analysis Graph theory Graphs Heuristic algorithms Indexes Maintenance Maintenance engineering Matching parallel algorithm Parallel algorithms Scalability Stability analysis
Citations:	Items that this one cites Items that cite this one
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!