A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network.

Ruen Chze Loh Sieteng Soh Mihai M. Lazarescu Suresh Rai

Published in: PRDC (2008)

Keyphrases

edge disjoint
spanning tree
minimum cost
special case
probability distribution
peer to peer
dynamic programming
small number
intrusion detection
complex networks
computer networks
input pattern
method finds