Enumerating Non-crossing Minimally Rigid Frameworks
type: Item
instance of: scholarly article
title: Enumerating Non-crossing Minimally Rigid Frameworks
zbMATH Open document ID: 1162.68729
DOI: 10.1007/11809678_23
author: David Avis
author: Naoki Katoh
author: M. Ohsaki
author: Ileana Streinu
author: Shin-Ichi Tanigawa
published in: Lecture Notes in Computer Science
publication date: 2007-09-10T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5189501
MaRDI profile type: MaRDI publication profile
full work available at URL: 11809678 23
OpenAlex ID: W1690630723
Recommended article: Enumerating non-crossing minimally rigid frameworks
Recommended article: Enumerating constrained non-crossing minimally rigid frameworks
Recommended article: Q4556063
Recommended article: Generic combinatorial rigidity of periodic frameworks
Recommended article: The number of embeddings of minimally rigid graphs
Recommended article: On the number of embeddings of minimally rigid graphs
Recommended article: Combinatorial Algorithm for a Lower Bound on Frame Rigidity
Recommended article: <scp>Almost‐Rigidity</scp> of Frameworks
Recommended article: Maximal rigid objects as noncrossing bipartite graphs
Recommended article: Q2990097
description: scientific article; zbMATH DE number 5189501