An algorithm for constructing edge-trees from hypergraphs (Q3671206)

From MaRDI portal
Revision as of 10:19, 14 June 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 algorithm for constructing edge-trees from hypergraphs
scientific article

    Statements

    title
    An algorithm for constructing edge-trees from hypergraphs (English)
    0 references
    author
    Fanica Gavril
    0 references
    Robert Tamari
    0 references
    published in
    Networks
    0 references
    publication date
    1983
    0 references
    zbMATH DE Number
    3823838
    0 references
    zbMATH Keywords
    edge-tree hypergraph
    0 references
    polynomial time algorithm
    0 references
    OpenAlex ID
    W1977216722
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3671206&oldid=34686340"
    Powered by MediaWiki