Author:
Yang Kai,Wu Weili,Zhang Wei,Hsu Tzuwei,Fan Lidan
Reference66 articles.
1. J. Abello, M.G.C. Resende, S. Sudarsky, Massive quasi-clique detection, in LATIN, pp. 598–612. doi:10.1007/3-540-45995-2-5134, 35
2. I. Abraham, C. Gavoille, D. Malkhi, On space-stretch trade-offs: lower bounds, inProceedings of the eighteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Cambridge, 30 July-02 Aug 2006 (ACM, New York, 2006), pp. 207–216
3. I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, M. Thorup, Compact name-independent routing with minimum stretch. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Barcelona, 2004
4. L.A. Adamic, E. Adar, Friends and neighbors on the web. Soc. Netw.25(3), 211–230 (2003)
5. G. Agarwal, D. Kempe, Modularity-maximizing graph communities via math- ematical programming. Eur. Phys. J. B 66, 409–418 (2008)