Finding weighted \(k\)-truss communities in large networks
From MaRDI portal
Publication:778465
DOI10.1016/j.ins.2017.07.012zbMath1444.91180MaRDI QIDQ778465
Tan Jin, Fanghua Ye, Zibin Zheng, Guohui Ling, Rong-Hua Li
Publication date: 2 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.07.012
91D30: Social networks; opinion dynamics
Related Items
Top-\(k\) team synergy problem: capturing team synergy based on C3, OCSM: finding overlapping cohesive subgraphs with minimum degree, Finding influential communities in networks with multiple influence types, Overlapping community detection with least replicas in complex networks, Identifying structural hole spanners to maximally block information propagation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- A note on the problem of reporting maximal cliques
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Efficient and effective community search
- A graph‐theoretic generalization of the clique concept
- The Structure and Function of Complex Networks
- Algorithm 457: finding all cliques of an undirected graph