Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (Q1399253): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some applications of doubly stochastic matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Time-slot assignment for TDMA-systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Restrictions and preassignments in preemptive open shop scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4073396 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5650698 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on SS/TDMA satellite communication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2816078 / rank | |||
Normal rank | |||
Revision as of 17:40, 5 June 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
