An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730)
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: An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph |
scientific article; zbMATH DE number 708711
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph |
scientific article; zbMATH DE number 708711 |
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
