A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...