Please use this identifier to cite or link to this item:
https://ir.vidyasagar.ac.in/jspui/handle/123456789/718Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Saha, Anita | |
| dc.date.accessioned | 2016-12-22T17:01:00Z | - |
| dc.date.available | 2016-12-22T17:01:00Z | - |
| dc.date.issued | 2006 | |
| dc.identifier.issn | 0972-8791 (Print) | |
| dc.identifier.uri | http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/718 | - |
| dc.description | 178-187 | en_US |
| dc.description.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. | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | Vidyasagar University , Midnapore , West-Bengal , India | en_US |
| dc.relation.ispartofseries | Journal of Physical Science;Vol 10 [2006] | |
| dc.subject | Design of algorithms | en_US |
| dc.subject | Analysis of algorithms | en_US |
| dc.subject | Parallel algorithms | en_US |
| dc.subject | Shortest-paths | en_US |
| dc.subject | Average distance | en_US |
| dc.subject | Centre | en_US |
| dc.subject | Diameter | en_US |
| dc.subject | Circular-arc graph | en_US |
| dc.title | Computation of Average Distance, Radius and Centre of a Circular-Arc Graph in Parallel | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Journal of Physical Sciences Vol.10 [2006] | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| JPS10art17.pdf | 682.91 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.