抄録
A-020
Efficient algorithms for network localization using cores of underlying graphs
◎李　　甍・大舘陽太・徳山　豪（東北大）
Network localization is important for networks with no prefixed positions of network nodes such as wireless sensor networks and mobile ad-hoc networks. We are given a subset of the set of n(n-1)/2 pairwise distances among n sensors in some Euclidean space. We would like to determine the positions of each sensors. The input can be seen as an edge weighted graph. In this paper, we present some efficient algorithms that solve this problem using the structures of input graphs, which we call the cores of them.