Chudnovsky et al. gave a min-max formula for the maximum number of node-disjoint non-zero A-paths in group-labeled graphs [1], which is a generalization of Mader?s theorem on node-disjoint A-paths [3]...
In this paper we present a min-max theorem for a factorization problem in directed graphs. This extends the Berge-Tutte formula on matchings as well as formulas for the maximum even factor in weakly s...
As a common generalization of matchings and matroid intersection, W.H. Cunningham and J.F. Geelen introduced the notion of path-matchings, then they introduced the more general notion of even factor i...
As a common generalization of matchings and matroid intersection, W.H. Cunningham and J.F. Geelen introduced the notion of path-matchings, then they introduced the more general notion of even factor i...
Abstract: An Extension to the Frequency Domain System Identification Toolbox for MATLAB has been developed. It adds a simple-to-use Graphical User Interface to the existing toolbox. It increases numer...