A Fast Parallel Construction of Disjoint Paths in Networks

Eli Shamir; Eli Upfal

doi:10.1016/S0304-0208(08)73079-2

A Fast Parallel Construction of Disjoint Paths in Networks

Eli Shamir
, Eli Upfal

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

An incremental connection problem is to add K disjoint paths from s₁ to t₁, 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.

Original language	English
Pages (from-to)	141-153
Number of pages	13
Journal	North-Holland Mathematics Studies
Volume	102
Issue number	C
DOIs	https://doi.org/10.1016/S0304-0208(08)73079-2
State	Published - 1 Jan 1985

Access to Document

10.1016/S0304-0208(08)73079-2

Cite this

@article{780aa342fa554448851ec7072f4a5c5d,

title = "A Fast Parallel Construction of Disjoint Paths in Networks",

abstract = "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.",

author = "Eli Shamir and Eli Upfal",

year = "1985",

month = jan,

day = "1",

doi = "10.1016/S0304-0208(08)73079-2",

language = "אנגלית",

volume = "102",

pages = "141--153",

journal = "North-Holland Mathematics Studies",

issn = "0304-0208",

publisher = "Elsevier B.V.",

number = "C",

}

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 - https://www.scopus.com/pages/publications/79959392308

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 -

A Fast Parallel Construction of Disjoint Paths in Networks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this