An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:33, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph |
scientific article |
Statements
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (English)
0 references
15 June 2000
0 references
