Sign in

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

Ruen Chze LohSieteng SohMihai M. LazarescuSuresh 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