Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (Q2116499): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3130470475 / rank
 
Normal rank

Revision as of 20:57, 19 March 2024

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
    0 references
    0 references
    0 references
    0 references
    subgraphs
    0 references
    uniform random graphs
    0 references
    randomized algorithms
    0 references
    0 references