Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (Q5470799)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 5029660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) |
scientific article; zbMATH DE number 5029660 |
Statements
Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (English)
0 references
1 June 2006
0 references
chordal graph
0 references
minimal fill
0 references
matrix multiplication
0 references
0.99989045
0 references
0.9220307
0 references
0.8845328
0 references
0.8816115
0 references
0.8794461
0 references
0.8774427
0 references
0.86847717
0 references
0.86687887
0 references
