2009 First International Workshop on Education Technology and Computer Science 2009
DOI: 10.1109/etcs.2009.421
|View full text |Cite
|
Sign up to set email alerts
|

A New Local Algorithm for Detecting Communities in Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2010
2010
2012
2012

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…In [18], the authors proceed to a greedy agglomerative algorithm, starting with the edge of highest contribution to its community.…”
Section: Community Detection Algorithmsmentioning
confidence: 99%
“…In [18], the authors proceed to a greedy agglomerative algorithm, starting with the edge of highest contribution to its community.…”
Section: Community Detection Algorithmsmentioning
confidence: 99%
“…Some algorithms have been proposed to detect local communities. For example, Tian et al [72] proposes an algorithm designed for both unweighted and weighted graphs.…”
Section: Local Community Detectionmentioning
confidence: 99%