Node-Disjoint Paths Problems in Directed Bijective Connection Graphs

Abstract

In this paper, we extend the notion of bijective connection graphs to introduce directed bijective connection graphs. We propose algorithms that solve the node-to-set node-disjoint paths problem and the node-to-node node-disjoint paths problem in a directed bijective connection graph. The time complexities of the algorithms are both O(n⁴), and the maximum path lengths are both 2n-1.