Algorithms for graph rigidity and scene analysis (Q5897236)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for graph rigidity and scene analysis |
scientific article; zbMATH DE number 5677115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for graph rigidity and scene analysis |
scientific article; zbMATH DE number 5677115 |
Statements
Algorithms - ESA 2003 (English)
0 references
3 March 2010
0 references
algorithm
0 references
graph families
0 references
edge counts
0 references
rigid component
0 references
redundantly rigid component
0 references
\(M\)-connected component
0 references
globally rigid component
0 references
bipartite graphs
0 references
parallel drawing
0 references
scene analysis
0 references
d-tight bipartite graphs
0 references
d-sharp subgraphs
0 references
0.8052301406860352
0 references
0.7934291958808899
0 references
0.7799164056777954
0 references
0.7676489353179932
0 references
