loading...
A Distributed Algorithm for the Maximum Flow Problem
Universit? of Lille 1, France July 04-July 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPDC.2005.4The 4th International Symposium on Pa ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Thuy Lien PHAM, Ivan LAVALLEE, Marc BUI, Si Hoang DO, "A Distributed Algorithm for the Maximum Flow Problem," Parallel and Distributed Computing, International Symposium on, pp. 131-138, The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISPDC.2005.4,
author = {Thuy Lien PHAM and Ivan LAVALLEE and Marc BUI and Si Hoang DO},
title = {A Distributed Algorithm for the Maximum Flow Problem},
journal ={Parallel and Distributed Computing, International Symposium on},
volume = {0},
year = {2005},
isbn = {0-7695-2434-6},
pages = {131-138},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPDC.2005.4},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing, International Symposium on
TI - A Distributed Algorithm for the Maximum Flow Problem
SN - 0-7695-2434-6
SP131
EP138
A1 - Thuy Lien PHAM,
A1 - Ivan LAVALLEE,
A1 - Marc BUI,
A1 - Si Hoang DO,
PY - 2005
KW - null
VL - 0
JA - Parallel and Distributed Computing, International Symposium on
ER -
 
Thuy Lien PHAM, Laboratoire de Recherche en Informatique Avancee Universite Paris, France
Ivan LAVALLEE, Laboratoire de Recherche en Informatique Avancee Universite Paris, France
Marc BUI, Laboratoire de Recherche en Informatique Avancee Universite Paris, France
Si Hoang DO, Laboratoire de Recherche en Informatique Avancee Universite Paris, France
This paper presents an asynchronous distributed algorithm for solving the maximum flow problem which is based on the preflow-push approach of Golberg-Tarjan. Each node in graph initially knows the capacities of outgoing and incoming adjacent arcs, the source nodes knows additionally the number of nodes in graph. Nodes execute the same algorithm, and exchange messages with neighbors until the maximum flow is established. The algorithm is applicable in cases of multiple sources and/or targets. We give also here some ideas to adjust our algorithm to dynamic changes of arc capacities.
Citation:
Thuy Lien PHAM, Ivan LAVALLEE, Marc BUI, Si Hoang DO, "A Distributed Algorithm for the Maximum Flow Problem," ispdc, pp.131-138, The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.