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

From MaRDI portal
Revision as of 11:14, 23 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (English)
    0 references
    author
    Elias Dahlhaus
    0 references
    Marek Karpinski
    0 references
    publication date
    15 June 2000
    0 references
    zbMATH DE Number
    708711
    0 references
    cites work
    Q3804207
    0 references
    Q3138901
    0 references
    Q3806672
    0 references
    Q3328583
    0 references
    Q4385522
    0 references
    Q4172915
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1341730&oldid=34137105"
    Powered by MediaWiki