An algorithmic proof of a generalization of the birkhoff-von neumann theorem

DOI10.1016/0196-6774(86)90024-6MaRDI QIDQ3748422zbMATH OpenOpenAlexFDO

Authors Jane W. S. Liu, Jerome L. V. Lewandowski, C. L. Liu

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90024-6

zbMATH Keywords

convex combinationdoubly stochastic matrixpermutation matrices

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Stochastic matrices (15B51)

Cited in

(8)

• An NC algorithm for Brooks' theorem
• SS/TDMA Satellite Communications withk-Permutation Switching Modes
• An algorithmic version of the blow-up lemma
• scientific article; zbMATH DE number 782043 (Why is no real title available?)
• scientific article; zbMATH DE number 915924 (Why is no real title available?)
• Birkhoff’s theorem for a family of probability spaces
• An algorithmic proof of Brégman–Minc theorem
• Two blossoming proofs of the Lane-Riesenfeld algorithm

This page was built for publication: An algorithmic proof of a generalization of the birkhoff-von neumann theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748422)