Efficient distributed algorithms for computing shortest pairs of maximally disjoint paths in communication networks | IEEE Conference Publication | IEEE Xplore