Rigid and globally rigid graphs with pinned vertices
Rigid and globally rigid graphs with pinned vertices
复制标题
具有固定顶点的刚性图和全局刚性图
DOI:
10.1007/978-3-642-13580-4_7
复制
发表时间:
2010
期刊:
影响因子:
--
通讯作者:
T. Jordán
中科院分区:
文献类型:
--
作者:
T. Jordán
We consider rigid and globally rigid bar-and-joint frameworks (resp. graphs) in which some joints (resp. vertices) are pinned down and hence their positions are fixed. We give an overview of some old and new results of this branch of combinatorial rigidity with an emphasis on the related optimization problems.In one of these problems the goal is to find a setPof vertices of minimum total cost for which the positions of all vertices become uniquely determined whenPis pinned down. For this problem, which is motivated by the localization problem in wireless sensor networks, we give a constant factor approximation algorithm.
DOI:
--
发表时间:
2008
期刊:
影响因子:
--
作者:
D.Avis;N.Katoh;M.Ohsaki;I.Streinu and S.Tanigawa;N.Katoh and S.Tanigawa;谷川眞一;谷川眞一;谷川眞一;谷川眞一;谷川眞一;谷川眞一;谷川眞一;谷川眞一;谷川眞一;谷川眞一;谷川眞一;S. Tanigawa
通讯作者:
S. Tanigawa
影响因子:
--
作者:
B. Jackson;T. Jordán
通讯作者:
B. Jackson;T. Jordán