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. |
---|---|
其他作者: | TEMASEK LABORATORIES |
格式: | Conference or Workshop Item |
出版: |
2013
|
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/43220 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Evaluating large graph processing in MapReduce based on message passing
由: Pan, W., et al.
出版: (2013) -
MapReduce for data analytics
由: Roy Ananya.
出版: (2013) -
Towards a general framework for secure MapReduce computation on hybrid clouds
由: Zhang, C., et al.
出版: (2014) -
Maestro : replica-aware map scheduling for MapReduce
由: Ibrahim, Shadi, et al.
出版: (2013) -
MapReduce and its applications in heterogeneous environment
由: Tan, Yu Shyang
出版: (2011)