Structure of the submarking-reachability problem and network programming

Using a linear programming formulation, a unified treatment of the submarking-reachability problem for both capacitated and uncapacitated marked graphs is presented. In both cases, the problem reduces to that of testing feasibility of the dual transshipment problem of operations research. An algorithm called REACH is presented for the feasibility testing problem; its worst-case time complexity is O(mn), where m and n are, respectively, the number of edges and the number of nodes in the marked graph. The place of this work in the context of general network programming problems is indicated.<
>