An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:00, 5 March 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
    0 references
    0 references
    15 June 2000
    0 references
    0 references