Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (Q1399253): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0024-3795(02)00691-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033739990 / rank | |||
Normal rank | |||
Latest revision as of 10:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations |
scientific article |
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
