An efficient distributed algorithm for canonical labeling on directed split-stars

Authors:
Fu-Hsing Wang
Affiliations:
Department of Information Management, Chinese Culture University, 55, Hwa-Kang Road, Yang-Ming-Shan, Taipei, 11114, Taiwan, ROC
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 10
Cited 0

Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness

Discrete Applied Mathematics
Distributed Algorithms

Distributed Algorithms
SETI@home: an experiment in public-resource computing

Communications of the ACM
Efficient Mining of Association Rules in Distributed Databases

IEEE Transactions on Knowledge and Data Engineering
Super-connectivity and super-edge-connectivity for some interconnection networks

Applied Mathematics and Computation
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars

Journal of Parallel and Distributed Computing
A distributed algorithm to find k-dominating sets

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Minimal feedback vertex sets in directed split-stars

Networks
Dynamic Load Balancing for the Distributed Mining of Molecular Structures

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.04

Visualization

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.