Article ID Journal Published Year Pages File Type
421343 Discrete Applied Mathematics 2008 8 Pages PDF
Abstract

We consider the problem of canonical labeling in anonymous directed split-stars. This paper proposes a distributed algorithm for finding the vertex sets with specified leading symbols in directed split-stars and which has a linear message and constant time complexity. The algorithm runs on an asynchronous timing model without shared memory. In addition, our algorithm generalizes the previous distributed algorithms on directed split-stars that we know.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,