Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (Q2116499)

From MaRDI portal
Revision as of 08:33, 28 July 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
Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
scientific article

    Statements

    Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (English)
    0 references
    0 references
    17 March 2022
    0 references
    subgraphs
    0 references
    uniform random graphs
    0 references
    randomized algorithms
    0 references

    Identifiers

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