Cyclic linking network

A general network link model is formulated, unifying the previous directed cyclic graphical network, linear deterministic network and layered linking network. It provides a seamless extension of Menger´s theorem that the network can be decomposed into disjoint augmenting paths up to the min-cut value even in the presence of cycles and interference. This is obtained by developing new concepts for linking systems, which also lead to polynomial-time algorithms that compute the shortest path, maximum flow and optimal path decomposition.