Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
type: Item
instance of: scholarly article
title: Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
zbMATH Open document ID: 1028.05061
DOI: 10.1016/S0024-3795(02)00691-2
author: Dominique De Werra
published in: Linear Algebra and its Applications
publication date: 2003-07-30T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15B51
zbMATH DE Number: 1956808
zbMATH Keywords: doubly stochastic matrices
zbMATH Keywords: equitable colorings
zbMATH Keywords: balancing of cardinalities
zbMATH Keywords: permutation matrices
reviewed by: Dragoš Cvetković
MaRDI profile type: Publication
cites work: Q3941433
cites work: Some applications of doubly stochastic matrices
cites work: Time-slot assignment for TDMA-systems
cites work: Restrictions and preassignments in preemptive open shop scheduling
cites work: Q4073396
cites work: Q5650698
cites work: A note on SS/TDMA satellite communication
cites work: Variations on the theorem of Birkhoff-von Neumann and extensions
full work available at URL: s0024-3795(02)00691-2
OpenAlex ID: W2033739990
description: scientific article; zbMATH DE number 1956808