A spanning-tree algorithm for constructing streams in pipelines

DOI10.1007/BF01305213MaRDI QIDQ1812852zbMATH OpenOpenAlexFDO

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

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) Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 4054989 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Maximum number of flows in a pipeline

Cited in

(2)

• Algebra of processes in graphs
• Decomposition in pipelines

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

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