Maximum number of flows in a pipeline

DOI10.1007/BF01091799zbMath0614.68037MaRDI QIDQ1819933

T. A. Tushkina, K. V. Shakhbazyan

Publication date: 1987

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

conveyerindependent data flowsminimal flows of informationunconditional pipeline computations

Mathematics Subject Classification ID

Theory of computing (68Q99)

Related Items (1)

A spanning-tree algorithm for constructing streams in pipelines

This page was built for publication: Maximum number of flows in a pipeline