A fast construction of disjoint paths in communication networks

Eli Shamir, Eli Upfal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

An incremental connection problem is to add k disjoint paths from si to ti, 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.

Original languageEnglish
Title of host publicationFoundations of Computation Theory - Proceedings of the 1983 International FCT-Conference
EditorsMarek Karpinski
PublisherSpringer Verlag
Pages428-438
Number of pages11
ISBN (Print)9783540126898
DOIs
StatePublished - 1983
EventInternational Symposium on Fundamentals of Computation Theory, FCT 1983 - Borgholm, Sweden
Duration: 21 Aug 198327 Aug 1983

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume158 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Symposium on Fundamentals of Computation Theory, FCT 1983
Country/TerritorySweden
CityBorgholm
Period21/08/8327/08/83

Bibliographical note

Publisher Copyright:
© 1983, Springer-Verlag.

Fingerprint

Dive into the research topics of 'A fast construction of disjoint paths in communication networks'. Together they form a unique fingerprint.

Cite this