Affordable Access

Publisher Website

A Fast Parallel Construction of Disjoint Paths in Networks

DOI: 10.1016/s0304-0208(08)73079-2
  • Computer Science


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.

There are no comments yet on this publication. Be the first to share your thoughts.