A biased edge enhancement method for truss-based community search  

作　　者：Yuqi LI Tao MENG Zhixiong HE Haiyan LIU Keqin LI 

机构地区：[1]School of Computer and Information Engineering,Central South University of Forestry and Technology,Changsha 410082,China [2]School of Business,Central South University of Forestry and Technology,Changsha 410082,China [3]College of Information Engineering,Changsha Medical University,Changsha 410219,China [4]Department of Computer Science,State University of New York,New York 12561,USA

出　　处：《Frontiers of Computer Science》2024年第3期251-253,共3页中国计算机科学前沿（英文版）

基　　金：supported by the Research Foundation of Education Bureau of Hunan Province of China(Grant Nos.20B625,22B0275);the Changsha Natural Science Foundation(Grant No.kq2202294).

摘　　要：1 Introduction A related study called community search,whose target is to find dense subgraphs containing the given node,has drawn a growing amount of attention recently[1].To explore the higher-order structure of complex networks,truss-based community search methods[2]have been proposed.Nevertheless,the truss-based hypergraph constructed from the original graph is frequently fragmented and consists of numerous subgraphs and isolated nodes[3],which boils down to the fact that these methods often pay only attention to the truss connections but ignore the lower-order connectivity of the original graph.

关 键 词：graph. TRUSS CONNECTIVITY 

分 类 号：O157.5[理学—数学] TP18[理学—基础数学]