Please use this identifier to cite or link to this item:
Title: Computation of Average Distance, Radius and Centre of a Circular-Arc Graph in Parallel
Authors: Saha, Anita
Keywords: Design of algorithms
Analysis of algorithms
Parallel algorithms
Average distance
Circular-arc graph
Issue Date: 2006
Publisher: Vidyasagar University , Midnapore , West-Bengal , India
Series/Report no.: Journal of Physical Science;Vol 10 [2006]
Abstract: The determination of centre of a graph is very important task in facility location problem. Computation of centre depends on the computation of radius of the graph. In this paper, we have design some parallel algorithms to find the average distance, radius, diameter and centre of a circular-arc graph. The proposed parallel algorithms run in O(n2/p + log n) time on a EREW PRAM, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.
Description: 178-187
ISSN: 0972-8791 (Print)
Appears in Collections:Journal of Physical Sciences Vol.10 [2006]

Files in This Item:
File Description SizeFormat 
JPS10art17.pdf682.91 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.