The theory of directed graphs has developed enormously over recent decades, yet this book
(first published in 2000) remains the only book to cover more than a small fraction of the …

The advent of very large scale integrated circuit technology has enabled the construction of
very complex and large interconnection networks. By most accounts, the next generation of …

Moore graphs and beyond: A survey of the degree/diameter problem Page 1 Moore graphs
and beyond: A survey of the degree/diameter problem Mirka Miller School of Mathematical …

Distributed Algorithms for Message-Passing Systems Page 1 Michel Raynal Distributed Algorithms
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …

This paper is a survey of existing methods of communication in usual networks. We
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …

Considerable attention in recent theoretical computer science is devoted to parallel
computing. Here, we would like to present a special part of this large topic, namely, the part …

Symmetries in constraint satisfaction or combinatorial optimization problems can cause
considerable dificulties for exact solvers. One way to overcome the problem is to employ …

The de Bruijn graph was proposed by de Bruijn and Good in 1946. It was initially employed
in binary sequence research but has been widely adopted across diverse fields and …

We show that the de Bruijn graph is appropriate for maintaining dynamic connections, eg,
between the members of a P2P application who join and leave the system at their …

A graph G contains a graph H as an induced minor if H can be obtained from G by vertex
deletions and edge contractions. The class of H-induced-minor-free graphs generalizes the …