Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (Q5470799): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:55, 7 March 2024
scientific article; zbMATH DE number 5029660
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
