Fast minimal triangulation algorithm using minimum degree criterion (Q551209)
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: Fast minimal triangulation algorithm using minimum degree criterion |
scientific article; zbMATH DE number 5920452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast minimal triangulation algorithm using minimum degree criterion |
scientific article; zbMATH DE number 5920452 |
Statements
Fast minimal triangulation algorithm using minimum degree criterion (English)
0 references
14 July 2011
0 references
minimal triangulations
0 references
chordal graphs
0 references
minimum degree
0 references
0 references
0 references
0 references
0.8781278729438782
0 references
0.8755592107772827
0 references
0.8721039295196533
0 references
0.8603196144104004
0 references
