Truss decomposition in massive networks

• المؤلفون الرئيسيون: Wang, Jia, Cheng, James
• مؤلفون آخرون: School of Computer Engineering
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2013
• الموضوعات: DRNTU::Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/98773; http://hdl.handle.net/10220/13430; http://dl.acm.org/citation.cfm?id=2311909

The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k-truss. Compared with k-core which is also efficient to compute, k-truss represents the...