Affordable Access

Publisher Website

A Fast Parallel Construction of Disjoint Paths in Networks

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

Abstract

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.

Statistics

Seen <100 times
0 Comments

More articles like this

Parallel Algorithm for Shortest Pairs of Edge-Disj...

on Journal of Parallel and Distri... Jan 01, 1996

General vertex disjoint paths in series-parallel g...

on Discrete Applied Mathematics Jan 01, 1993

Parallel complexity of computing a maximal set of...

on Information Processing Letters Jan 01, 1992
More articles like this..