## To Find the Comparison of Non-Split Domination Number , The Average Distance and The Diameter of Circular-Arc Graphs

- Dr. A. Sudhakaraiah, B. Radhamma, K. Ramakrishna, M. Reddappa
- 2016

- Published 2006

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… (More)

### Presentations referencing similar topics