Finding Disjoint Paths in Boolean-Valued Networks

Algorithms for finding disjoint paths in a network are of great importance for improving reliability of network connections. In this paper, we consider the problem of finding optimal disjoint paths within a specific network model that can be useful for secure routing and quality of service support. We propose an exact algorithm for finding k optimal link-disjoint paths in a Boolean-valued network. We also include an example demonstrating the proposed algorithm.