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

Muriel Médard, Steven G. Finn, Richard A. Barry. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Trans. Netw., 7(5):641-652, 1999. [doi]

@article{MedardFB99:0,
  title = {Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs},
  author = {Muriel Médard and Steven G. Finn and Richard A. Barry},
  year = {1999},
  url = {http://portal.acm.org/citation.cfm?id=319510.319517},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MedardFB99%3A0},
  cites = {0},
  citedby = {0},
  journal = {IEEE/ACM Trans. Netw.},
  volume = {7},
  number = {5},
  pages = {641-652},
}