Broadcasting in Hypercubes and Star Graphs with Dynamic Faults
暂无分享,去创建一个
[1] Sheldon B. Akers,et al. On Group Graphs and Their Fault Tolerance , 1987, IEEE Transactions on Computers.
[2] Andrzej Pelc. Fault‐tolerant broadcasting and gossiping in communication networks , 1996 .
[3] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[4] Selim G. Akl,et al. Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions , 1995, J. Parallel Distributed Comput..
[5] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[6] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.
[7] Ivan Stojmenovic,et al. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry , 1993, Networks.
[8] Pierre Fraigniaud,et al. Broadcasting in a Hypercube when Some Calls Fail , 1991, Inf. Process. Lett..
[9] Luisa Gargano,et al. Fault Tolerant Routing in the Star and Pancake Interconnection Networks , 1993, Inf. Process. Lett..
[10] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[11] Pierre Fraigniaud,et al. Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..
[12] Ivan Hal Sudborough,et al. Three disjoint path paradigms in star networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[13] Luisa Gargano,et al. Fault - tolerant hypercube broadcasting via information dispersal , 1993, Networks.
[14] Luisa Gargano,et al. Minimum time broadcast in faulty star networks , 1998, Discret. Appl. Math..
[15] Selim G. Akl,et al. Decomposing a Star Graph Into Disjoint Cycles , 1991, Inf. Process. Lett..
[16] Selim G. Akl,et al. A Novel Routing Scheme on the Star and Pancake Networks and its Applications , 1993, Parallel Comput..
[17] Pradip K. Srimani,et al. Topological properties of star graphs , 1993 .
[18] David Peleg. A Note on Optimal Time Broadcast in Faulty Hypercubes , 1995, J. Parallel Distributed Comput..
[19] Khaled Day,et al. A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..
[20] Chandra GowriSankaran,et al. Broadcasting on recursively decomposable Cayley graphs , 1994 .
[21] Dana S. Richards,et al. Reliable broadcasting , 1994, Discret. Appl. Math..
[22] Krzysztof Diks,et al. Broadcasting in synchronous networks with dynamic faults , 1996 .
[23] Selim G. Akl,et al. Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance , 1996, IEEE Trans. Computers.
[24] D. Du,et al. Combinatorial Network Theory , 1996 .