A MapReduce-Based Maximum-Flow Algorithm for Large Small-World Network Graphs

Felix Halim, Roland H. C. Yap, Yongzheng Wu. A MapReduce-Based Maximum-Flow Algorithm for Large Small-World Network Graphs. In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011. pages 192-202, IEEE Computer Society, 2011. [doi]

@inproceedings{HalimYW11,
  title = {A MapReduce-Based Maximum-Flow Algorithm for Large Small-World Network Graphs},
  author = {Felix Halim and Roland H. C. Yap and Yongzheng Wu},
  year = {2011},
  doi = {10.1109/ICDCS.2011.62},
  url = {http://dx.doi.org/10.1109/ICDCS.2011.62},
  tags = {rule-based, data-flow, graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/HalimYW11},
  cites = {0},
  citedby = {0},
  pages = {192-202},
  booktitle = {2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-4364-2},
}