F. McSherry. Spectral partitioning of random graphs. In 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Improved Algorithms for the Random Cluster Graph Model - Shamir, Tsur (2002) (2 citations) (Correct)
....making small modifications to the algorithms. For example, the algorithm of Condon and Karp can be extended to the case where the number of clusters is non constant. Also, the running time of the algorithm of Ben Dor et al. can be improved to O(n log n) 13] After obtaining our results, McSherry [10] gave a new polynomial algorithm for the clustering problem that requires that k =##3 1 # n log n # 2 3 n 2 3 ) For the case of equal sized clusters, our algorithm has a wider range of k when k # Ben Dor et al. 1] n) ##23 O(n This study ##u 1 # # n log n) ## n 1 2 # ) # O(mn ....
F. McSherry. Spectral partitioning of random graphs. In Proc. 42nd Symposium on Foundation of Computer Science (FOCS '01), pages 529--537, 2001.
Correlation Clustering - Bansal, Blum, Chawla (2002) (15 citations) (Correct)
....f . The analysis is fairly standard (much like the generic transformation of Kearns [16] in the machine learning context, and even closer to the analysis of Condon and Karp for graph partitioning [11] In fact, this problem nearly matches a special case of the plantedpartition problem of McSherry [18]. We present our analysis anyway since the algorithms are so simple. One sided noise: As an easier special case, let us consider only one sided noise in which each true edge is flipped to with probability . In that case, if u and v are in different clusters of OPT, then jN (v)j = 0 ....
F. McSherry. Spectral partitioning of random graphs. In FOCS, pages 529--537, 2001.
On Spectral Properties of Graphs, and Their Application to.. - Bilu (2004) (Correct)
No context found.
F. McSherry. Spectral partitioning of random graphs. In 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001.
Improved Algorithms for the Random Cluster Graph Model - Ron Shamir Dekel (2002) (2 citations) (Correct)
No context found.
F. McSherry. Spectral partitioning of random graphs. In Proc. 42nd Symposium on Foundation of Computer Science (FOCS '01), pages 529--537, 2001.
Spectral Techniques Applied to Sparse Random Graphs - Feige, Ofek (2003) (Correct)
No context found.
F. McSherry. Spectral partitioning of random graphs. In Proceedings of the 42nd Anual Symposium on Foundations of Computer Science (FOCS 2001.
Correlation Clustering - Nikhil Bansal Avrim (2002) (15 citations) (Correct)
No context found.
F. McSherry. Spectral partitioning of random graphs. In FOCS, pages 529--537, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC