1. On routing and diameter of metacyclic graphs.
- Author
-
Xiao, Wenjun and Parhami, Behrooz
- Subjects
- *
GRAPHIC methods , *CAYLEY graphs , *ALGORITHMS , *DIAMETER , *ARRAY processors - Abstract
Metacyclic graphs, which include supertoroids as a subclass, have been shown to possess interesting properties and potential applications in implementing moderate- to large-size parallel processors with fairly small node degrees. Wu, Lakshmivarahan, and Dhall (J. Parallel Distrib. Comput. 60 (2000), pp. 539-565) have described a deterministic, distributed routing scheme for certain subclasses of metacyclic graphs. However, they offer no proof that the scheme is a shortest-path routing algorithm and do not indicate whether or how their scheme may be extended to the entire class of metacyclic graphs. In this paper, we provide a near-shortest-path, deterministic routing algorithm that is applicable to any metacyclic graph and derive a bound for the diameter of such graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF