A MapReduce-based maximum-flow algorithm for large small-world network graphs
10.1109/ICDCS.2011.62
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
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 |
id |
sg-nus-scholar.10635-43220 |
---|---|
record_format |
dspace |
spelling |
sg-nus-scholar.10635-432202023-10-30T22:35:52Z A MapReduce-based maximum-flow algorithm for large small-world network graphs Halim, F. Yap, R.H.C. Wu, Y. COMPUTER SCIENCE TEMASEK LABORATORIES 10.1109/ICDCS.2011.62 Proceedings - International Conference on Distributed Computing Systems 192-202 PICSE 2013-07-23T09:28:13Z 2013-07-23T09:28:13Z 2011 Conference Paper Halim, F., Yap, R.H.C., Wu, Y. (2011). A MapReduce-based maximum-flow algorithm for large small-world network graphs. Proceedings - International Conference on Distributed Computing Systems : 192-202. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDCS.2011.62 9780769543642 http://scholarbank.nus.edu.sg/handle/10635/43220 000295121900019 Scopus |
institution |
National University of Singapore |
building |
NUS Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NUS Library |
collection |
ScholarBank@NUS |
description |
10.1109/ICDCS.2011.62 |
author2 |
COMPUTER SCIENCE |
author_facet |
COMPUTER SCIENCE Halim, F. Yap, R.H.C. Wu, Y. |
format |
Conference or Workshop Item |
author |
Halim, F. Yap, R.H.C. Wu, Y. |
spellingShingle |
Halim, F. Yap, R.H.C. Wu, Y. A MapReduce-based maximum-flow algorithm for large small-world network graphs |
author_sort |
Halim, F. |
title |
A MapReduce-based maximum-flow algorithm for large small-world network graphs |
title_short |
A MapReduce-based maximum-flow algorithm for large small-world network graphs |
title_full |
A MapReduce-based maximum-flow algorithm for large small-world network graphs |
title_fullStr |
A MapReduce-based maximum-flow algorithm for large small-world network graphs |
title_full_unstemmed |
A MapReduce-based maximum-flow algorithm for large small-world network graphs |
title_sort |
mapreduce-based maximum-flow algorithm for large small-world network graphs |
publishDate |
2013 |
url |
http://scholarbank.nus.edu.sg/handle/10635/43220 |
_version_ |
1781411213657243648 |