Truss Decomposition on Multilayer Graphs

Hongxuan Huang, Qingyuan Linghu, Fan Zhang, Dian Ouyang, Shiyu Yang

Abstract: 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.