Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
community detection algorithm |
| gptkbp:complexity |
O(m^2 n)
|
| gptkbp:field |
graph theory
network science |
| gptkbp:hasConcept |
edge betweenness
|
| https://www.w3.org/2000/01/rdf-schema#label |
Girvan-Newman algorithm
|
| gptkbp:input |
graph
|
| gptkbp:inventedBy |
gptkb:Mark_Newman
gptkb:Michelle_Girvan |
| gptkbp:method |
iteratively removes edges with highest betweenness
|
| gptkbp:namedAfter |
gptkb:Mark_Newman
gptkb:Michelle_Girvan |
| gptkbp:output |
community structure
|
| gptkbp:publicationYear |
2002
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_National_Academy_of_Sciences
|
| gptkbp:purpose |
detect communities in complex networks
|
| gptkbp:relatedTo |
gptkb:Louvain_method
modularity edge betweenness centrality |
| gptkbp:bfsParent |
gptkb:Louvain_Community_Detection
|
| gptkbp:bfsLayer |
7
|