论文信息 - Notes on the Birkhoff Algorithm for Doubly Stochastic Matrices - 字舞流文

Notes on the Birkhoff Algorithm for Doubly Stochastic Matrices

Abstract The purpose of this note is to tie together some results concerning doubly stochastic matrices and their representations as convex combinations of permutation matrices.

Richard A. Brualdi | R. Brualdi

[1] R. Brualdi,et al. A unified treatment of nearly reducible and nearly decomposable matrices , 1979 .

[2] H. Schneider. The Birkhoff—Egerváry—Kőnig theorem for matrices over lattice ordered abelian groups , 1977 .

[3] DOUBLY STOCHASTIC MATRICES AND SEQUENTIAL DATA ASSOCIATION PART I , 1979 .

[4] R. Brualdi,et al. Convex polyhedra of doubly stochastic matrices—IV , 1976 .

[5] Marvin Marcus,et al. DIAGONALS OF DOUBLY STOCHASTIC MATRICES , 1959 .

[6] An Elementary Proof of Johnson–Dulmage–Mendelsohn's Refinement of Birkhoff's Theorem on Doubly Stochastic Matrices , 1979, Canadian Mathematical Bulletin.

[7] D. Hartfiel. A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices , 1970 .

[8] Richard A. Brualdi. The diagonal hypergraph of a matrix (bipartite graph) , 1979, Discret. Math..