Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fete of Combinatorics and Computer ScienceRigid and Globally Rigid Graphs with Pinned Vertices

Fete of Combinatorics and Computer Science: Rigid and Globally Rigid Graphs with Pinned Vertices [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fete of Combinatorics and Computer ScienceRigid and Globally Rigid Graphs with Pinned Vertices

Part of the Bolyai Society Mathematical Studies Book Series (volume 20)
Editors: Katona, Gyula O. H.; Schrijver, Alexander; Szőnyi, Tamás; Sági, Gábor
Jordán, Tibor
Fete of Combinatorics and Computer Science — Jan 31, 2011
Download PDF
21 pages

Loading next page...
 
/lp/springer-journals/fete-of-combinatorics-and-computer-science-rigid-and-globally-rigid-QJ014xYq4i
Publisher
Springer Berlin Heidelberg
Copyright
© János Bolyai Mathematical Society and Springer-Verlag 2010
ISBN
978-3-642-13579-8
Pages
151 –172
DOI
10.1007/978-3-642-13580-4_7
Publisher site
See Chapter on Publisher Site

Abstract

[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.]

Published: Jan 31, 2011

There are no references for this article.