This paper presents a new family of undirected graphs that allows N processors to be connected in a network of diameter 3/2 log2 N + O(1), while only requiring that each processor be connected to three neighbors. The best trivalent graphs previously proposed require a diameter of 2 log2N + O(1).
No takes yet. Share an insight, caveat, or question.
Leland et al. (1982) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: