A MapReduce-based maximum-flow algorithm for large small-world network graphs
10.1109/ICDCS.2011.62
Saved in:
Main Authors: | Halim, F., Yap, R.H.C., Wu, Y. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/43220 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Evaluating large graph processing in MapReduce based on message passing
by: Pan, W., et al.
Published: (2013) -
MapReduce for data analytics
by: Roy Ananya.
Published: (2013) -
Towards a general framework for secure MapReduce computation on hybrid clouds
by: Zhang, C., et al.
Published: (2014) -
Maestro : replica-aware map scheduling for MapReduce
by: Ibrahim, Shadi, et al.
Published: (2013) -
MapReduce and its applications in heterogeneous environment
by: Tan, Yu Shyang
Published: (2011)