Necessary Condition for Path Partitioning Constraints

Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes in G. This article provides a necessary condition for the K node-disjoint paths problem which combines (1) the structure of the reduced graph associated with G, (2) the structure of each strongly connected component of G with respect to dominance relation between nodes, and (3) the way the nodes of two strongly connected components are inter-connected. This necessary condition is next used to deal with a path partitioning constraint.

• Type: Conference
• Year: 2007
• Where: CPAIOR
• Authors: Nicolas Beldiceanu, Xavier Lorca
• Keywords: CPAIOR 2007, Directed Graph G, Node-disjoint Paths, Node-disjoint Paths Problem