Finding weighted k-truss communities in large networks

DOI10.1016/J.INS.2017.07.012MaRDI QIDQ778465zbMATHOpenAlexFDO

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

zbMATH Keywords

weighted networkscommunity searchweighted \(k\)-truss community

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

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

• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• A graph‐theoretic generalization of the clique concept
• A note on the problem of reporting maximal cliques
• Algorithm 457: finding all cliques of an undirected graph
• Classifying molecular sequences using a linkage graph with their pairwise similarities
• Efficient and effective community search
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• The Structure and Function of Complex Networks
• The worst-case time complexity for generating all maximal cliques and computational experiments

Cited in

(7)

• Efficient and effective community search
• Finding influential communities in networks with multiple influence types
• Approaches to community search under complex conditions
• 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
• Top-\(k\) team synergy problem: capturing team synergy based on C3

Describes a project that uses

Uses Software

• Algorithm 457

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)