Efficient computation of most probably states for communication networks with multimode components

DOI10.1109/26.24607zbMath0672.94024OpenAlexW2125504186MaRDI QIDQ3826490

Peter Kubat, Che-Liang Yang

Publication date: 1989

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/26.24607

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

This page was built for publication: Efficient computation of most probably states for communication networks with multimode components