A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
The Design of Small-Diameter Networks by Local Search
IEEE Transactions on Computers
Topological constraints on interconnection-limited logic
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Broadcasting in Generalized de Bruijn Digraphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the k-tuple domination of de Bruijn and Kautz digraphs
Information Processing Letters
Absorbant of generalized de Bruijn digraphs
Information Processing Letters
Line Digraph Iterations and the (d, k) Digraph Problem
IEEE Transactions on Computers
Large Graphs with Given Degree and Diameter Part I
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
A Fault-Tolerant Communication Architecture for Distributed Systems
IEEE Transactions on Computers
Towards address privacy in mobile ad hoc networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
The twin domination number in generalized de Bruijn digraphs
Information Processing Letters
On Address Privacy in Mobile Ad Hoc Networks
Mobile Networks and Applications
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
FISH: a novel peer-to-peer overlay network based on
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Turbo NOC: a framework for the design of network-on-chip-based turbo decoder architectures
IEEE Transactions on Circuits and Systems Part I: Regular Papers
On chip interconnects for multiprocessor turbo decoding architectures
Microprocessors & Microsystems
The k-tuple twin domination in generalized de Bruijn and Kautz networks
Computers & Mathematics with Applications
Radial Moore graphs of radius three
Discrete Applied Mathematics
Theory and network applications of balanced kautz tree structures
ACM Transactions on Internet Technology (TOIT)
The Hamiltonian property of consecutive-d digraphs
Mathematical and Computer Modelling: An International Journal
The hamiltonian property of the consecutive-3 digraph
Mathematical and Computer Modelling: An International Journal
The Hamiltonian property of linear functions
Operations Research Letters
Note: Hamiltonicity of large generalized de Bruijn cycles
Discrete Applied Mathematics
| Hi-index | 14.99 |
This paper proposes a simple algorithm for the graph design of small-diameter networks. For given nodes n and degree d, this algorithm can be used to construct a directed graph with diameter ?logd n?, which is at most one larger than the lower bound ?logd (n(d - 1) + 1)? - 1. Its average distance is also close to the lower bound. The algorithm can be used to construct a directed graph with smaller diameter, compared with any other conventional methods, when n is larger.