The Partial Line Digraph Technique in the Design of Large Interconnection Networks
暂无分享,去创建一个
[1] Miguel Angel Fiol,et al. Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.
[2] Miguel Angel Fiol,et al. Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.
[3] Makoto Imase,et al. A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.
[4] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[5] Gérard Memmi,et al. Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.
[6] Charles Delorme,et al. Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..
[7] Jean-Claude Bermond,et al. Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY , 1983 .
[8] Sam Toueg,et al. On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.
[9] Makoto Imase,et al. Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.
[10] Kenneth Steiglitz,et al. The Design of Small-Diameter Networks by Local Search , 1979, IEEE Transactions on Computers.
[11] Makoto Imase,et al. Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.
[12] Miguel Angel Fiol,et al. Maximally connected digraphs , 1989, J. Graph Theory.
[13] Tse-yun Feng,et al. A Survey of Interconnection Networks , 1981, Computer.
[14] M. Aigner. On the linegraph of a directed graph , 1967 .