A Fast Parallel Construction of Disjoint Paths in Networks

Eli Shamir, Eli Upfal

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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.

Original languageEnglish
Pages (from-to)141-153
Number of pages13
JournalNorth-Holland Mathematics Studies
Volume102
Issue numberC
DOIs
StatePublished - 1 Jan 1985

Fingerprint

Dive into the research topics of 'A Fast Parallel Construction of Disjoint Paths in Networks'. Together they form a unique fingerprint.

Cite this