Truss Decomposition on Multilayer Graphs

Multilayer graphs are very powerful in representing the multiplex relationships among entities. The truss decomposition on single-layer graphs is a well-studied problem which divides a graph into a hierarchy structure, and has a series of applications. However, little attention has been paid to the...

Full description

Saved in:
Bibliographic Details
Published in2021 IEEE International Conference on Big Data (Big Data) pp. 5912 - 5915
Main Authors Huang, Hongxuan, Linghu, Qingyuan, Zhang, Fan, Ouyang, Dian, Yang, Shiyu
Format Conference Proceeding
LanguageEnglish
Published IEEE 15.12.2021
Subjects
Big Data
Conferences
Multilayer graph
Multiplexing
Nonhomogeneous media
Periodic structures
Truss decomposition
Online AccessGet full text

Cover

More Information
Summary:Multilayer graphs are very powerful in representing the multiplex relationships among entities. The truss decomposition on single-layer graphs is a well-studied problem which divides a graph into a hierarchy structure, and has a series of applications. However, little attention has been paid to the truss decomposition on multilayer graphs. In addition, truss decomposition on multilayer graphs derives new challenges compared to the scenario on single-layer graphs. In this paper, we devise an efficient algorithm to compute the truss decomposition on multilayer graphs. Extensive experiments on 5 real-life datasets validate the effectiveness and efficiency of our methods.
DOI:10.1109/BigData52589.2021.9671831