Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations

From MaRDI portal
(Redirected from Publication:1399253)





The author extends the decomposition theorem of Birkhoff-von Neumann for nonnegative matrices with constant row and column sums to integral matrices whose entries can be positive or negative. In graph-theoretical interpretation, instead of matchings we have collections of oriented paths with disjoint end nodes.











This page was built for publication: Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399253)