Abstract
An incremental connection problem is to add k disjoint paths from s i to t i , 1≤i≤k, in an operating network. A parallel distributed algorithm is presented, which solves the problem efficiently in a general situation. Its probable performance is analyzed in a random graph setup.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S.N. Bhatt, On concentration and connection networks, TM 196/1981, M.I.T. Cambridge, Mass. 1981.
P. Erdös, The Art of Counting — Selected Writings. J. Spencer Ed., The M.I.T. Press, Cambridge 1973.
M.R. Garey and D.S. Johnson, Computers and Intractability A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.
E. Shamir and E. Upfal, N — processors graphs distributively achieve perfect matchings in O(log2 N) beats. Proc. of Annual ACM Sym. on Principles of Distributed Computing, 1982, 238–241.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shamir, E., Upfal, E. (1983). A fast construction of disjoint paths in communication networks. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_123
Download citation
DOI: https://doi.org/10.1007/3-540-12689-9_123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12689-8
Online ISBN: 978-3-540-38682-7
eBook Packages: Springer Book Archive