Yüklüyor......
Lower Bounds on the Number of Realizations of Rigid Graphs
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Toward this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastest available method, although its complexity is still exponen...
Kaydedildi:
| Yayımlandı: | Exp Math |
|---|---|
| Asıl Yazarlar: | , , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Taylor & Francis
2018
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7324120/ https://ncbi.nlm.nih.gov/pubmed/32655833 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1080/10586458.2018.1437851 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|