Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations (Q2332459)

From MaRDI portal
Revision as of 23:06, 28 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127216168, #quickstatements; #temporary_batch_1722203565125)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations
scientific article

    Statements

    Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 November 2019
    0 references
    von Neumann entropy
    0 references
    von Neumann graph entropy
    0 references
    graph dissimilarity
    0 references
    density matrix
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references