Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph (Q2576353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2241397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph |
scientific article; zbMATH DE number 2241397 |
Statements
Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph (English)
0 references
27 December 2005
0 references
doubly chordal graph
0 references
doubly perfect elimination ordering
0 references
0.7895578742027283
0 references
0.7868375182151794
0 references