
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
July 1983 (vol. 9 no. 4)
pp. 504512
ASCII Text  x  
null ToYat Cheung, "Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation," IEEE Transactions on Software Engineering, vol. 9, no. 4, pp. 504512, July, 1983.  
BibTex  x  
@article{ 10.1109/TSE.1983.234958, author = {null ToYat Cheung}, title = {Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation}, journal ={IEEE Transactions on Software Engineering}, volume = {9}, number = {4}, issn = {00985589}, year = {1983}, pages = {504512}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1983.234958}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation IS  4 SN  00985589 SP504 EP512 EPD  504512 A1  null ToYat Cheung, PY  1983 KW  model KW  Distributed computation KW  distributed graph algorithms KW  graph traversal techniques KW  maximum network flow problem VL  9 JA  IEEE Transactions on Software Engineering ER   
This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. It has three major parts. Section I describes the computational environment for the design and description of distributed graph algorithms in terms of an architectural model for message exchanges. The computational complexity is measured in terms of the number of messages transmitted. Section II presents several distributed algorithms for the pure traversal, depthfirst search, and breadthfirst search techniques. Their complexities are also given. Through these descriptions are brought out some of the intrinsic differences in the behaviors and complexities of the fundamental traversal techniques between a serial and a distributed computation environment. Section III gives the distributed version of the Ford and Fulkerson algorithm for the maximum flow problem by means of depthfirst search, the largestaugmentation search and breadthfirst search. The complexities of these methods are found to be 0(f*A), 0((l + logM/(M1)f*VA) and O(V6), respectively, where f* is the maximum flow value of the problem, M is the maximum number of ucs in a cut, V is the number of vertices, and A is the number of arcs. Lastly, it is shown that the largest augmentation search may be a better method than the other two. This is contrary to the known results in serial computation.
Index Terms:
model, Distributed computation, distributed graph algorithms, graph traversal techniques, maximum network flow problem
Citation:
null ToYat Cheung, "Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation," IEEE Transactions on Software Engineering, vol. 9, no. 4, pp. 504512, July 1983, doi:10.1109/TSE.1983.234958
Usage of this product signifies your acceptance of the Terms of Use.