Paths are edge-disjoint when no graph edge occurs in two of them. They may share internal vertices. If edge-disjoint client-to-server paths exist, fewer than failed links cannot destroy them all. For simultaneous link and node failures one instead needs internally vertex-disjoint paths, since one shared internal node could destroy several edge-disjoint paths at once.
Articles by others on the same topic
There are currently no matching articles.