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

CCUR > College of Business > Department of Information Management & Graduate Institute of Information Management > periodical articles > Item 987654321/2507

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/2507

Title:	An efficient distributed algorithm for canonical labeling on directed split-stars
Authors:	Wang, Fu-Hsing
Contributors:	資管系
Keywords:	Directed split-stars Distributed algorithms Canonical labeling Message complexity Time complexity
Date:	2008
Issue Date:	2009-11-03 14:53:30 (UTC+8)
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 oil directed split-stars that we know. (C) 2008 Elsevier B.V. All rights reserved.
Relation:	DISCRETE APPLIED MATHEMATICS Volume: 156 Issue: 18 Pages: 3475-3482
Appears in Collections:	[Department of Information Management & Graduate Institute of Information Management] periodical articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	Text	832	View/Open