arXiv · 1502.02278
Universal Rigidity of Complete Bipartite Graphs
Abstract
We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $(K(n,m),p,q)$. This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general position. Even without any of these assumptions, in complete generality, we extend these ideas to obtain an efficient algorithm, based on a sequence of linear programs, that determines whether an input framework of a complete bipartite graph is universally rigid or not.
Explore related subjects
Keep this discovery
Robert Connelly, Steven J. Gortler. 2016-10-13. Universal Rigidity of Complete Bipartite Graphs. https://arxiv.org/abs/1502.02278
Cite the original work for its findings. Save a collection to share your selection of sources.