Charikar's algorithm for densest subgraph
GPTKB entity
Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:approximationRatio |
1
|
| gptkbp:citation |
highly cited
|
| gptkbp:complexity |
O(m log n)
|
| gptkbp:designedFor |
finding densest subgraph
|
| https://www.w3.org/2000/01/rdf-schema#label |
Charikar's algorithm for densest subgraph
|
| gptkbp:input |
graph
|
| gptkbp:output |
subgraph with maximum average degree
|
| gptkbp:proposedBy |
gptkb:Moses_Charikar
|
| gptkbp:publicationYear |
2000
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_32nd_Annual_ACM_Symposium_on_Theory_of_Computing_(STOC_2000)
|
| gptkbp:relatedTo |
graph theory
densest subgraph problem |
| gptkbp:step |
iteratively remove vertex with minimum degree
|
| gptkbp:supportsAlgorithm |
greedy algorithm
|
| gptkbp:usedIn |
bioinformatics
network analysis data mining social network analysis community detection |
| gptkbp:bfsParent |
gptkb:Moses_Charikar
|
| gptkbp:bfsLayer |
7
|