Improved Schemes for Node Clustering in Decentralized Peer-to-Peer Networks
暂无分享,去创建一个
[1] Dhiraj K. Pradhan,et al. A cluster-based approach for routing in dynamic networks , 1997, CCRV.
[2] Ulrik Brandes,et al. Experiments on Graph Clustering Algorithms , 2003, ESA.
[3] Lakshmish Ramaswamy,et al. Connectivity based node clustering in decentralized peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).
[4] Lakshmish Ramaswamy,et al. A distributed approach to node clustering in decentralized peer-to-peer networks , 2005, IEEE Transactions on Parallel and Distributed Systems.
[5] S. Dongen. A new cluster algorithm for graphs , 1998 .
[6] Yan Li,et al. SACA: SCM-based adaptive clustering algorithm , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.
[7] Julio Solano-González,et al. Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..
[8] Yan Li,et al. SDC: A Distributed Clustering Protocol for Peer-to-Peer Networks , 2006, Networking.
[9] Julio Solano-González,et al. Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[10] Dahlia Malkhi,et al. K-clustering in wireless ad hoc networks , 2002, POMC '02.
[11] S. vanDongen. Performance criteria for graph clustering and Markov cluster experiments , 2000 .
[12] Adrian Barbu,et al. Graph partition by Swendsen-Wang cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.