Greedy approximation algorithms for finding dense components in a graph
Citations
811 citations
Cites methods from "Greedy approximation algorithms for..."
...Therefore, we define a heuristic for k-partite graphs inspired by a 2-approximation greedy algorithm for arbitrary graphs (Charikar, 2000; Khuller and Saha, 2009)....
[...]
462 citations
Cites background or methods from "Greedy approximation algorithms for..."
...Charikar [7] showed that the greedy algorithm that we consider in this paper can be used to .nd a factor-2 approximation....
[...]
...As observed by Charikar [7], Greedy can be implemented in linear time....
[...]
...As observed by Charikar [7], Greedy can be implemented in linear time....
[...]
...Charikar [7] showed that the greedy algorithm that we consider in this paper can be used to find a factor-2 approximation....
[...]
...[4] and later analyzed by Charikar [7], who showed that it achieves a factor 2 approximation guarantee for the densest-subgraph problem....
[...]
321 citations
Cites methods from "Greedy approximation algorithms for..."
...Heaviest-subnet This method is inspired by Charikar's 2-approximation algorithm for the densest subgraph problem [46]....
[...]
303 citations
Cites background from "Greedy approximation algorithms for..."
...Often, the communities identified will correspond to some notion of “dense subgraphs” [4, 13, 14, 23]....
[...]
290 citations
Cites background or methods from "Greedy approximation algorithms for..."
...Charikar [10] shows that the greedy algorithm proposed by Asashiro et al....
[...]
...For finding densest subgraphs, we use the Goldberg’s exact algorithm [19] for small graphs, while for graphs whose size does not allow the Goldberg’s algorithm to terminate in reasonable time we use the Charikar’s 1 2 -approximation algorithm [10]....
[...]
...[6], which has been shown to provide a 1 2 -approximation for the densest subgraph problem [10]....
[...]
References
1,440 citations
1,126 citations
1,116 citations
"Greedy approximation algorithms for..." refers background in this paper
...Recently, the problem of finding relatively highly connected sub-structures in the web graph has received a lot of attention [8,10,11,12]....
[...]
905 citations
"Greedy approximation algorithms for..." refers background in this paper
...Recently, the problem of finding relatively highly connected sub-structures in the web graph has received a lot of attention [ 8 ,10,11,12]....
[...]