返回
Truss decomposition using triangle graphs
DOI:10.1007/s00500-021-06468-9.png)
摘要
En 中文
Recent studies have shown that social networks exhibit interesting characteristics such as community structures, i.e., vertexes can be clustered into communities that are densely connected together and loosely connected to other vertices. In order to identify communities, several definitions were proposed that can characterize the density of connections among vertices in the networks. Dense triangle cores, also known as k-trusses, are subgraphs in which every edge participates at least k - 2 triangles (a clique of size 3), exhibiting a high degree of cohesiveness among vertices. There are a number of research works that propose k-truss decomposition algorithms. However, existing in-memory algorithms for computing k-truss are inefficient for handling today's massive networks. In this paper, we propose an efficient, yet scalable algorithm for finding k-trusses in a large-scale network. To this end, we propose a new structure, called triangle graph to speed up the process of finding the k-trusses and prove the correctness and efficiency of our method. We also evaluate the performance of the proposed algorithms through extensive experiments using real-world networks. The results of comprehensive experiments show that the proposed algorithms outperform the state-of-the-art methods by several orders of magnitudes in running time.
Keyword:
Truss decomposition
Triangle graph
Community detection
Social networks
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Heteroduplex mobility assay and single-stranded conformation polymorphism analysis as methodologies for detecting variants of human erythroviruses异源双链迁移测定和单链构象多态性分析作为检测人细小病毒变异体的方法学
Enhanced tobacco mosaic virus production and suppressed synthesis of the inhibitor of virus replication in protoplasts and plants of local lesion responding cultivars exposed to 35 °C在35°C条件下,对产生局部病斑反应的品种的原生质体和植株,增强了烟草花叶病毒的产量,并抑制了病毒复制抑制剂的合成。

