Database Reference
In-Depth Information
51. J. Kim, I. Hwang, Y.-H. Kim, and B.-R. Moon. Genetic approaches for graph parti-
tioning: A survey. In
Proceedings of the 13th Annual Conference on Genetic and
Evolutionary Computation, GECCO'11
, pages 473-480, New York, 2011. ACM.
52. S. Koranne. A distributed algorithm for k-way graph partitioning. In
EUROMICRO
, 1999.
53. J. Leskovec. Stanford network analysis project. http://snap.stanford.edu/, 2013.
54. LinkedIn. Numbers of LinkedIn members as of 1st quarter 2013. http://www.statista.
com/statistics/198224/quarterly-member-numbers-of-linkedin/, 2013.
55. Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein.
Distributed graphlab: A framework for machine learning and data mining in the cloud.
Proc. VLDB Endow.
, 5(8):716-727, April 2012.
56. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. Hellerstein. Graphlab:
A new framework for parallel machine learning. In
UAI
, 2010.
57. H. Maini, K. Mehrotra, C. Mohan, and S. Ranka. Genetic algorithms for graph par-
titioning and incremental graph partitioning. In
Proceedings of the 1994 ACM/IEEE
Conference on Supercomputing, Supercomputing'94
, pages 449-457, Los Alamitos,
CA, 1994. IEEE Computer Society Press.
58. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G.
Czajkowski. Pregel: A system for large-scale graph processing. In
Proceedings of the
2010 ACM SIGMOD International Conference on Management of Data. SIGMOD'10
,
pages 135-146, 2010.
59. J. Maue and P. Sanders. Engineering algorithms for approximate weighted matching. In
Proceedings of the 6th International Conference on Experimental Algorithms
,
WEA'07
,
pages 242-255, Berlin, Heidelberg, 2007. Springer-Verlag.
60. G. L. Miller, S. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning.
Technical Report, Ithaca, NY, 1992.
61. NCBI. PubChem. http://pubchem.ncbi.nlm.nih.gov, 2013.
62. NCBI. Submit data to NCBI. http://pubchem.ncbi.nlm.nih.gov/search/#, 2013.
63. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing
order to the web. Technical Report 1999-66, 1999.
64. R. Power and J. Li. Piccolo: Building fast, distributed programs with partitioned tables.
In
Proceedings of the 9th USENIX Conference on Operating Systems Design and
Implementation, OSDI'10
, pages 1-14, 2010.
65. J. M. Pujol, V. Erramilli, G. Siganos, X. Yang, N. Laoutaris, P. Chhabra, and P. Rodriguez.
The little engine(s) that could: Scaling online social networks. In
Proceedings of the
ACM SIGCOMM 2010 Conference, SIGCOMM'10
, pages 375-386, 2010.
66. E. Rolland, H. Pirkul, and F. Glover. Tabu search for graph partitioning. Annals of
Operations Research, 1996.
67. B. Shao, H. Wang, and Y. Li. The trinity graph engine. Technical report, Microsoft
Research, 2012.
68. B. Shao, H. Wang, and Y. Xiao. Managing and mining large graphs: Systems and imple-
mentations. In
Proceedings of the 2012 ACM SIGMOD International Conference on
Management of Data, SIGMOD'12
, pages 589-592, New York, 2012. ACM.
69. J. Siek, L.-Q. Lee, and A. Lumsdaine. The Boost Graph Library: User Guide and
Reference Manual. Addison-Wesley, 2002.
70. Socialbakers. Facebook pages statistics. http://www.socialbakers.com/facebook-pages/,
2011.
71. D. Spielman. Spectral graph theory and its applications. In
48th Annual IEEE Symposium
on Foundations of Computer Science, 2007. FOCS'07
, pages 29-38, 2007.
72. I. Stanton and G. Kliot. Streaming graph partitioning for large distributed graphs.
In
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge
Discovery and Data Mining, KDD'12
, pages 1222-1230, New York, 2012. ACM.
Search WWH ::
Custom Search