Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (Q1399253)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations |
scientific article; zbMATH DE number 1956808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations |
scientific article; zbMATH DE number 1956808 |
Statements
Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (English)
0 references
30 July 2003
0 references
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.
0 references
doubly stochastic matrices
0 references
equitable colorings
0 references
balancing of cardinalities
0 references
permutation matrices
0 references
0.81788170337677
0 references
0.7757484316825867
0 references
0.7601370215415955
0 references
0.7576543688774109
0 references
