TY - JOUR
T1 - A Fast Parallel Construction of Disjoint Paths in Networks
AU - Shamir, Eli
AU - Upfal, Eli
PY - 1985/1/1
Y1 - 1985/1/1
N2 - An incremental connection problem is to add K disjoint paths from s1 to t1, 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, using branching process methods.
AB - An incremental connection problem is to add K disjoint paths from s1 to t1, 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, using branching process methods.
UR - http://www.scopus.com/inward/record.url?scp=79959392308&partnerID=8YFLogxK
U2 - 10.1016/S0304-0208(08)73079-2
DO - 10.1016/S0304-0208(08)73079-2
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:79959392308
SN - 0304-0208
VL - 102
SP - 141
EP - 153
JO - North-Holland Mathematics Studies
JF - North-Holland Mathematics Studies
IS - C
ER -