De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations-Reference-Cited by-同舟云学术

De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations

Published:1996 Issue: Volume: Page:65-105
ISSN:1384-6485
Container-title:Combinatorial Network Theory
language:
Short-container-title:

Author:

Du Ding-Zhu,Cao Feng,Hsu D. Frank

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4757-2491-2_3

Reference47 articles.

1. N. Alon and M. Tarsi, Colorings and Orientations of graphs, Combinatorica to appear.

2. J.C. Bermond, N. Homobonpo, and C. Peyrat, Large fault-tolerant interconnection networks, Graphs and Combinatorics, (1989).

3. J.C. Bermond, F. Comellas, and F. Hsu, Distributed loop computer networks: a survey, IEEE Trans. on Computers, to appear.

4. J.C. Bermond and C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube? preprint.

5. J.C. Bermond and C. Peyrat, Broadcasting in de Bruijn networks, Proc. 19-th Southeastern Conference on Combinatorics, graph Theory and Computing, 1988.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Unmixedness Problems of Colored Pushdown Automata;IEICE Transactions on Information and Systems;2023-03-01

2. Finite Automata with Colored Accepting States and Their Unmixedness Problems;IEICE Transactions on Information and Systems;2022-03-01

3. Problem of Determining Weights of Edges for Reducing Diameter;Advances in Intelligent Networking and Collaborative Systems;2019-08-15

4. An Algorithm for Multi-Source Broadcasting on Kautz Digraphs Using 2-Cycle Rooted Trees;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2010