Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2008
Session Number:P2
Session:
Number:P2-107
Kernel Reference Set and Its Computation Algorithm
Ding-Yuan Bian, Qi-Wei Ge, Qian Zhu, Qian-Ming Shao,
pp.-
Publication Date:2008/7/7
Online ISSN:2188-5079
Summary:
This paper proposes a new concept of graphs: kernel reference set. A kernel reference set is a fraction of vertices in a graph such that if their positions are known, positions of all other vertices can be derived from information of the distance matrix. We present an algorithm to find kernel reference set of graphs. Because the problem of kernel reference set is firstly proposed in this paper, and the theoretical limit of computation complexity is unknown currently. So we implement our algorithm with C to do the simulation. From simulation results, we verified the validity of our algorithm and evaluate its performance.