An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730)
From MaRDI portal
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
0 references
