Graph complexity and the laplacian matrix in blocked experiments (Q3199446)

From MaRDI portal
Revision as of 12:35, 21 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
Graph complexity and the laplacian matrix in blocked experiments
scientific article

    Statements

    title
    Graph complexity and the laplacian matrix in blocked experiments (English)
    0 references
    publication date
    1990
    0 references
    zbMATH DE Number
    4174969
    0 references
    zbMATH Keywords
    efficiency
    0 references
    Laplacian matrix
    0 references
    maximal complexity
    0 references
    OpenAlex ID
    W2043719240
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3199446&oldid=34837601"
    Powered by MediaWiki