One-to-many node-disjoint paths in image-star graphs Original Research Article

We present an algorithm which given a source node and a set of image target nodes in the image-star graph image, where all nodes are distinct, builds a collection of image node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most image, and the algorithm has time complexity image.