Abstract

We consider routing plans on graphs with two entries for each origination-destination pair. It is shown that graphs whose edge set can be covered by edge-disjoint triangles allow reliable networks. We conclude with some remarks on optimally reliable graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call