Local Community Detection Based on Small Cliques
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks. This is a faster alternative to algorithms that detect communities that cover the whole network when actually only a sing...
Main Authors: | Michael Hamann, Eike Röhrs, Dorothea Wagner |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-08-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/10/3/90 |
Similar Items
-
Local Optimization for Clique-Based Overlapping Community Detection in Complex Networks
by: Jian Ma, et al.
Published: (2020-01-01) -
Airline Network Structure: Motifs and Airports’ Role in Cliques
by: Huijuan Yang, et al.
Published: (2021-08-01) -
Approaching the Optimal Solution of the Maximal <i>α</i>-quasi-clique Local Community Problem
by: Patricia Conde-Cespedes
Published: (2020-09-01) -
Maximal Clique Scheduling: A Simple Algorithm to Bound Maximal Independent Graph Scheduling
by: Sutuntivorakoon, Kanes
Published: (2012) -
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
by: Chuan-Min Lee
Published: (2021-01-01)