Broadcasting in Bounded Degree Graphs
暂无分享,去创建一个
Arthur L. Liestman | Jean-Claude Bermond | Pavol Hell | Joseph G. Peters | A. L. Liestman | P. Hell | J. Bermond | J. Peters
[1] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .
[2] E. J. COCKAYNE,et al. Information Dissemination in Trees , 1981, SIAM J. Comput..
[3] David Peleg,et al. Tight Bounds on Minimum Broadcast Networks , 1991, SIAM J. Discret. Math..
[4] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[5] Arthur M. Farley,et al. Minimum broadcast graphs , 1979, Discret. Math..
[6] Arthur L. Liestman. Fault-tolerant broadcast graphs , 1985, Networks.
[7] A. M. Farley. Minimal broadcast networks , 1979, Networks.
[8] W. Daniel Hillis,et al. The connection machine , 1985 .
[9] Arthur L. Liestman,et al. Broadcast Networks of Bounded Degree , 1988, SIAM J. Discret. Math..
[10] Luisa Gargano,et al. On the construction of minimal broadcast networks , 1989, Networks.
[11] Charles Delorme,et al. Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..
[12] Arthur L. Liestman,et al. Sparse broadcast graphs , 1992, Discret. Appl. Math..
[13] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[14] Sven Skyum,et al. Families of Fixed Degree Graphs for Processor Interconnection , 1984, IEEE Transactions on Computers.
[15] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .