Login / Signup

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs.

Muriel MédardSteven G. FinnRichard A. Barry
Published in: IEEE/ACM Trans. Netw. (1999)
Keyphrases
  • undirected graph
  • data sets
  • highly redundant
  • neural network
  • case study
  • data structure
  • weighted graph