A spanning-tree algorithm for constructing streams in pipelines
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part 8, Tome 159 (1987), pp. 40-46
Cet article a éte moissonné depuis la source Math-Net.Ru
An algorithm based on the construction of a spanning subgraph of the pipeline is proposed for determining streams in pipelines.
@article{ZNSL_1987_159_a3,
author = {K. V. Shakhbazyan and T. A. Tushkina and M. M. Lebedinskii},
title = {A spanning-tree algorithm for constructing streams in pipelines},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {40--46},
year = {1987},
volume = {159},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1987_159_a3/}
}
TY - JOUR AU - K. V. Shakhbazyan AU - T. A. Tushkina AU - M. M. Lebedinskii TI - A spanning-tree algorithm for constructing streams in pipelines JO - Zapiski Nauchnykh Seminarov POMI PY - 1987 SP - 40 EP - 46 VL - 159 UR - http://geodesic.mathdoc.fr/item/ZNSL_1987_159_a3/ LA - ru ID - ZNSL_1987_159_a3 ER -
K. V. Shakhbazyan; T. A. Tushkina; M. M. Lebedinskii. A spanning-tree algorithm for constructing streams in pipelines. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part 8, Tome 159 (1987), pp. 40-46. http://geodesic.mathdoc.fr/item/ZNSL_1987_159_a3/