Graph theoretic models for multicast communications
- 1 December 1990
- journal article
- Published by Elsevier in Computer Networks and ISDN Systems
- Vol. 20 (1-5) , 95-99
- https://doi.org/10.1016/0169-7552(90)90014-j
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Performance of a broadcast packet switchIEEE Transactions on Communications, 1989
- Approximations for the Random Minimal Spanning Tree with Application to Network ProvisioningOperations Research, 1988
- Nonblocking copy networks for multicast packet switchingIEEE Journal on Selected Areas in Communications, 1988
- Distributed Multi-Destination Routing: The Constraints of Local InformationSIAM Journal on Computing, 1985
- Multicast Communication on Network ComputersIEEE Software, 1985
- Constrained Optimum Communication Trees and Sensitivity AnalysisSIAM Journal on Computing, 1984
- Constant Time Generation of Rooted TreesSIAM Journal on Computing, 1980
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Optimum Communication Spanning TreesSIAM Journal on Computing, 1974