A spanning-tree algorithm for constructing streams in pipelines

DOI10.1007/BF01305213zbMath0830.68104OpenAlexW2090050703MaRDI QIDQ1812852

K. V. Shakhbazyan, M. M. Lebedinskij, T. A. Tushkina

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1007/bf01305213

zbMATH Keywords

flows in unconditional pipeline computers

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Related Items (2)

Algebra of processes in graphs ⋮ Decomposition in pipelines

Cites Work

• Maximum number of flows in a pipeline
• Unnamed Item
• Unnamed Item

This page was built for publication: A spanning-tree algorithm for constructing streams in pipelines