Share Your Research, Maximize Your Social Impacts
Algorithms to find vertex-to-clique Center in a Graph using BC-representation
Journal: International Journal of Advanced Networking and Applications (Vol.4, No. 06)Publication Date: 2013-05-06
Authors : A. Ashok Kumar; S. Athisayanathan; A. Antonysamy;
Page : 1809-1811
Keywords : Clique; distance; eccentricity; radius; center; binary count;
Source : Download
Find it from : Google Scholar
Abstract
In this paper, we introduce algorithms to find the vertex-to-clique (or (V, ζ ))-distance d(v, C ) between a vertex v and a clique C in a graph G, (V, ζ )-eccentricity e1 (v) of a vertex v, and (V, ζ )-center Z1(G) of a graph G usingBC - representation. Moreover, the algorithms are proved for their correctness and analyzed for their time complexity.
Other Latest Articles
- Overview of the Side Channel Attacks
- OSRWQOS: Optimized Secure Routing Protocol with QoS against Byzantine Attack
- ECLB: A Novel Exhaustive Criterion Based Load Balancing Algorithm for E-Learning Platform by Data Grid Technologies
- Predicting Reliability of Software Using Thresholds of CK Metrics
- Analysis of Adaptive Group Key Management Protocol Using Network Simulator 2
Last modified: 2015-12-03 18:43:40