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