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

DOI10.1016/0196-6774(86)90024-6zbMATH Open0608.15011OpenAlexW1991316766MaRDI QIDQ3748422FDOQ3748422

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

doubly stochastic matrixpermutation matricesconvex combination

Mathematics Subject Classification ID

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

Cited In (8)

• An algorithmic proof of Brégman–Minc theorem
• An NC algorithm for Brooks' theorem
• SS/TDMA Satellite Communications withk-Permutation Switching Modes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two blossoming proofs of the Lane-Riesenfeld algorithm
• An algorithmic version of the blow-up lemma
• Birkhoff’s theorem for a family of probability spaces

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)