A MapReduce-based maximum-flow algorithm for large small-world network graphs

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2011, Pages 192-202

  Halim, Felix ^a   Yap, Roland H C ^a   Wu, Yongzheng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

FACEBOOK; FORD-FULKERSON METHOD; LOW DIAMETERS; MAP-REDUCE; MAX FLOW ALGORITHM; MAXIMUM-FLOW ALGORITHM; MEMORY-RESIDENT; SMALL WORLD NETWORKS; SOCIAL NETWORKS; VOTING SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS; INTERNET; VOTING MACHINES;

CLUSTERING ALGORITHMS;

EID: 80051907375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2011.62     Document Type: Conference Paper

References (32)

1. D.A. Bader and V.Sachdeva. "A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic", ISCA PDCS, 2005.
2. R.Chen, X.Weng, B.He, and M.Yang. "Large graph processing in the cloud", SIGMOD, 2010.
3. J.Dean and S.Ghemawat. "Mapreduce: Simplified data processing on large clusters", OSDI, 2004.
4. http://www.facebook.com/press/info.php?statistics.
5. http://developer.yahoo.com/blogs/hadoop/posts/2010/08/ apachehadoopbestpracticesa/.
6. http://hadoop.apache.org.
7. http://www.graph500.org.
8. http://www.oracle.com/technology/events/hpcconsortium2010/ graph500oraclehpcconsortium052910.pdf.
9. G.W. Flake, S.Lawrence, and C.L. Giles. "Efficient identification of web communities", SIGKDD, 2000.
10. L.Ford and D.Fulkerson. "Maximal flow through a network", Canadian Journal of Mathematics, 1956.
11. S.Ghemawat, H.Gobioff, and S.T. Leung. "The Google file system", SOSP, 2003.
12. A.V. Goldberg. "Recent developments in maximum flow algorithms", Scandinavian Workshop on Algorithm Theory, 1998.
13. A.V. Goldberg and R.E. Tarjan. "A new approach to the maximum flow problem", STOC, 1986.
14. U.Kang, C.Tsourakakis, A.P. Appel, C.Faloutsos, and J.Leskovec. "Hadi: Fast diameter estimation and mining in massive graphs with hadoop", Technical Report CMU-ML-08- 117, 2008.
15. H.Karloff, S.Suri, and S.Vassilvitskii. "A model of computation for MapReduce", Symp. on Discrete Algorithms, 2010.
16. J.Lin and M.Schatz. "Design patterns for efficient graph algorithms in MapReduce", Mining and Learning with Graphs Workshop, 2010.
17. 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", PODC, 2009.
18. S. Milgram. "The small world problem", Psychology Today, 1967.
19. K.Shvachko, H.Kuang, S.Radia, and R.Chansler. "The Hadoop distributed file system", Storage Conference, 2010.
20. N.Tran, B.Min, J.Li, and L.Subramanian. "Sybil-resilient online content voting", NSDI, 2009.
21. H.Yu, M.Kaminsky, P.B. Gibbons, and A.Flaxman. "Sybilguard: Defending against sybil attacks via social networks", SIGCOMM, 2006.
22. H.Saito, M.Toyoda, M.Kitsuregawa, and K.Aihara. "A Large- Scale Study of Link Spam Detection by Graph Algorithms", AIRWEB, 2007.
23. N.Imafuji, and M.Kitsuregawa. "Finding Web Communities by Maximum Flow Algorithm using Well-Assigned Edge Capacities", IEICE Trans Inf Syst, 2004.
24. R.Albert, H.Jeong, and A.L.Barabasi. "The diameter of the World Wide Web", Nature, 1999.
25. A.Mislove, M.Marcon, K.P.Gummadi, P.Druschel, and B.Bhattacharjee. "Measurement and Analysis of Online Social Networks", IMC, 2007.
26. S.Spek, E.Postma, and H.J.V.D.Herik. "Wikipedia: organisation from a bottom-up approach", Wikisym, 2006.
27. M.Kulkarni, M.Burtscher, R.Inkulu, K.Pingali, and C.Cascaval. "How Much Parallelism is There in Irregular Applications?", PPoPP, 2009.
28. B.V. Cherkassky, and A.V. Goldberg. "On Implementing Push-Relabel Method For The Maximum Flow Problem", Algorithmica, 1994.
29. 2 log n) Parallel Max- Flow Algorithm", Journal of Algorithms 3, 1982.
30. E.A.Dinic. "Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation", Soviet Math. Dokl., 1970.
31. J.Edmonds, and R.M.Karp. "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", J. Assoc. Comput. Mach., 1972.
32. A.V.Goldberg, and S.Rao. "Beyond the Flow Decomposition Barrier", IEEE Annual Symp. on Foundations of Computer Science, 1997.