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
A Regular Network for Multicomputer Systems
IEEE Transactions on Computers
Families of Fixed Degree Graphs for Processor Interconnection
IEEE Transactions on Computers
New Designs for Dense Processor Interconnection Networks
IEEE Transactions on Computers
Torus and Other Networks as Communication Networks With Up to Some Hundred Points
IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
| Hi-index | 14.99 |
Some attention is currently directed toward maximizing the number of nodes in a graph, each node of which receives no more than d branches and may be reached from any other node along a path of no more than k branches. This note introduces two improved techniques for construction and provides a table (with 1=d, k=10) indicating the current status of this problem.