Distributed Algorithm for Truss Maintenance in Dynamic Graphs

  • Qi Luo
  • , Dongxiao Yu*
  • , Hao Sheng
  • , Jiguo Yu
  • , Xiuzhen Cheng
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Cohesive subgraphs are applied in various fields. Mining cohesive components such as k-truss have attracted a lot of effort to improve time efficiency in large-scale graphs. The k-truss is a subgraph where each edge is contained in at least k- 2 triangles and the problem of truss decomposition is computing the k-trusses of a graph for all k. However, most graphs in real scenarios are usually changing over time. The previous studies take the static graphs as input, and the truss maintenance in dynamic graphs receives little attention. This paper focuses on distributed algorithms for truss maintenance. We present a distributed model underlying the real distributed processing model Pregel. Based on the model, we propose truss decomposition and truss maintenance algorithms. To confirm the effectiveness and efficiency of the proposed algorithms, we conduct extensive experiments over both real-world and synthetic graphs.

Original languageEnglish
Title of host publicationParallel and Distributed Computing, Applications and Technologies - 21st International Conference, PDCAT 2020, Proceedings
EditorsYong Zhang, Yicheng Xu, Hui Tian
PublisherSpringer Science and Business Media Deutschland GmbH
Pages104-115
Number of pages12
ISBN (Print)9783030692438
DOIs
StatePublished - 2021
Event21st International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2020 - Shenzhen, China
Duration: 28 Dec 202030 Dec 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12606 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2020
Country/TerritoryChina
CityShenzhen
Period28/12/2030/12/20

Keywords

  • Distributed algorithm
  • Dynamic graph
  • Graph analytics
  • k-truss

Fingerprint

Dive into the research topics of 'Distributed Algorithm for Truss Maintenance in Dynamic Graphs'. Together they form a unique fingerprint.

Cite this