A fast construction of disjoint paths in communication networks

Eli Shamir; Eli Upfal

doi:10.1007/3-540-12689-9_123

A fast construction of disjoint paths in communication networks

Eli Shamir
, Eli Upfal

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

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.

Original language	English
Title of host publication	Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference
Editors	Marek Karpinski
Publisher	Springer Verlag
Pages	428-438
Number of pages	11
ISBN (Print)	9783540126898
DOIs	https://doi.org/10.1007/3-540-12689-9_123
State	Published - 1983
Event	International Symposium on Fundamentals of Computation Theory, FCT 1983 - Borgholm, Sweden Duration: 21 Aug 1983 → 27 Aug 1983

Publication series

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

Conference

Conference	International Symposium on Fundamentals of Computation Theory, FCT 1983
Country/Territory	Sweden
City	Borgholm
Period	21/08/83 → 27/08/83

Bibliographical note

Publisher Copyright:
© 1983, Springer-Verlag.

Access to Document

10.1007/3-540-12689-9_123

Cite this

Shamir, E., & Upfal, E. (1983). A fast construction of disjoint paths in communication networks. In M. Karpinski (Ed.), Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference (pp. 428-438). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 158 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-12689-9_123

Shamir, Eli ; Upfal, Eli. / A fast construction of disjoint paths in communication networks. Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference. editor / Marek Karpinski. Springer Verlag, 1983. pp. 428-438 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1e56073cea37439281cf5f2d07ba5f7d,

title = "A fast construction of disjoint paths in communication networks",

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

author = "Eli Shamir and Eli Upfal",

note = "Publisher Copyright: {\textcopyright} 1983, Springer-Verlag.; International Symposium on Fundamentals of Computation Theory, FCT 1983 ; Conference date: 21-08-1983 Through 27-08-1983",

year = "1983",

doi = "10.1007/3-540-12689-9\_123",

language = "אנגלית",

isbn = "9783540126898",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "428--438",

editor = "Marek Karpinski",

booktitle = "Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference",

address = "גרמניה",

}

Shamir, E & Upfal, E 1983, A fast construction of disjoint paths in communication networks. in M Karpinski (ed.), Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 158 LNCS, Springer Verlag, pp. 428-438, International Symposium on Fundamentals of Computation Theory, FCT 1983, Borgholm, Sweden, 21/08/83. https://doi.org/10.1007/3-540-12689-9_123

A fast construction of disjoint paths in communication networks. / Shamir, Eli; Upfal, Eli.
Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference. ed. / Marek Karpinski. Springer Verlag, 1983. p. 428-438 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 158 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A fast construction of disjoint paths in communication networks

AU - Shamir, Eli

AU - Upfal, Eli

PY - 1983

Y1 - 1983

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84863404264

U2 - 10.1007/3-540-12689-9_123

DO - 10.1007/3-540-12689-9_123

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84863404264

SN - 9783540126898

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 428

EP - 438

BT - Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference

A2 - Karpinski, Marek

PB - Springer Verlag

T2 - International Symposium on Fundamentals of Computation Theory, FCT 1983

Y2 - 21 August 1983 through 27 August 1983

ER -

Shamir E, Upfal E. A fast construction of disjoint paths in communication networks. In Karpinski M, editor, Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference. Springer Verlag. 1983. p. 428-438. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-12689-9_123

A fast construction of disjoint paths in communication networks

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this