| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331045 | Information Processing Letters | 2016 | 10 Pages |
Abstract
Although an efficient algorithm which determines mixed-connectivity is still not known, our result implies that both edge-redundancy for rigidity and edge-redundancy for global rigidity can be checked via efficient graph-connectivity algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Adnan Sljoka,