Numeric algorithms for corank two edge-bipartite graphs and their mesh geometries of roots (Q4595593)
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: Numeric algorithms for corank two edge-bipartite graphs and their mesh geometries of roots |
scientific article; zbMATH DE number 6815545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numeric algorithms for corank two edge-bipartite graphs and their mesh geometries of roots |
scientific article; zbMATH DE number 6815545 |
Statements
Numeric Algorithms for Corank Two Edge-bipartite Graphs and their Mesh Geometries of Roots (English)
0 references
5 December 2017
0 references
edge-bipartite graph
0 references
mesh geometry of roots
0 references
Dynkin diagram
0 references
Coxeter-Dynkin type
0 references
0.9287363290786744
0 references
0.9191694855690002
0 references
0.9060743451118468
0 references
0.8818920850753784
0 references
