Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs

Basic Algebra I.

Andy R. Magid, Nathan Jacobson · American Mathematical Monthly · 1986 · 842 citations

Distributed Loop Computer-Networks: A Survey

J Bermond, Francesc Comellas, D. Frank Hsu · Journal of Parallel and Distributed Computing · 1995 · 393 citations · Full text

Computing, Computer Engineering, Computer Science +11

A Combinatorial Problem Related to Multimodule Memory Organizations

Chris K.C. Wong, Don Coppersmith · Journal of the ACM · 1974 · 251 citations · Full text

Natural Sciences, Computer Engineering, Computer Science +10

Design to Minimize Diameter on Building-Block Network

Imase, Itoh · IEEE Transactions on Computers · 1981 · 215 citations

Computing, Computer Science, Computational Geometry +15

Line Digraph Iterations and the (d, k) Digraph Problem

M.A. Fiol, Yebra, De Miquel · IEEE Transactions on Computers · 1984 · 211 citations

Computing, Computer Science, Mathematics +12