Franklin H. Moss, Adrian Segall
IEEE TACON
This paper is concerned with the problem of defining K multiple paths between pairs of nodes in a network. The treatment presented here is on a theoretical level, although the problem is motivated by a practical scheme for message routing in store‐and‐forward packet switched computer networks. Theorems are presented which offer readily testable sufficient conditions on the topology of a network which guarantee the existence of at least one set of paths under consideration. The proof of this theorem provides a generalized systematic method for constructing these paths if the sufficient conditions are met. Copyright © 1981 Wiley Periodicals, Inc., A Wiley Company
Franklin H. Moss, Adrian Segall
IEEE TACON
George Markowsky, Franklin H. Moss
IEEE Transactions on Communications
Philip M. Merlin, David J. Farber
IEEE Transactions on Communications
Jeffrey M. Jaffe, Franklin H. Moss
IEEE Transactions on Communications