Complexité de l'arboricité linéaire d'un graphe (Q3953783)

From MaRDI portal
Revision as of 21:54, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexité de l'arboricité linéaire d'un graphe
scientific article

    Statements

    title
    Complexité de l'arboricité linéaire d'un graphe (English)
    0 references
    publication date
    1982
    0 references
    zbMATH DE Number
    3773619
    0 references
    zbMATH Keywords
    linear arboricity
    0 references
    N.P.-complexity
    0 references
    chains forests
    0 references
    author
    Bernard Peroche
    0 references
    OpenAlex ID
    W2488617184
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3953783&oldid=31855663"
    Powered by MediaWiki