Finding weighted k-truss communities in large networks
From MaRDI portal
Publication:778465
DOI10.1016/J.INS.2017.07.012zbMATH Open1444.91180OpenAlexW2735638351MaRDI QIDQ778465FDOQ778465
Authors: Zibin Zheng, Fanghua Ye, Guohui Ling, Tan Jin, Ronghua 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
Recommendations
- Community detection for weighted networks with unknown number of communities
- Community detection with the weighted parsimony criterion
- Algorithms and Models for the Web-Graph
- Enhancing community detection using a network weighting strategy
- Detecting community structure: from parsimony to weighted parsimony
- Toward optimal community detection: from trees to general weighted networks
- COMMUNITY FINDING IN COMPLEX NETWORKS
- The k-Dense Method to Extract Communities from Complex Networks
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Title not available (Why is that?)
- A graph‐theoretic generalization of the clique concept
- A note on the problem of reporting maximal cliques
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Efficient and effective community search
Cited In (5)
- Identifying structural hole spanners to maximally block information propagation
- Overlapping community detection with least replicas in complex networks
- OCSM: finding overlapping cohesive subgraphs with minimum degree
- Finding influential communities in networks with multiple influence types
- Top-\(k\) team synergy problem: capturing team synergy based on C3
Uses Software
This page was built for publication: Finding weighted \(k\)-truss communities in large networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778465)
