Learning an efficient constructive sampler for graphs (Q511780)

From MaRDI portal
Revision as of 01:42, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57931583, #quickstatements; #temporary_batch_1712190744730)
scientific article
Language Label Description Also known as
English
Learning an efficient constructive sampler for graphs
scientific article

    Statements

    title
    Learning an efficient constructive sampler for graphs (English)
    0 references
    author
    Fabrizio Costa
    0 references
    publication date
    22 February 2017
    0 references
    zbMATH Keywords
    graph construction
    0 references
    graph sampling
    0 references
    graph kernels
    0 references
    Metropolis-Hastings sampling
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T05
    0 references
    60J22
    0 references
    62D05
    0 references
    68Q42
    0 references
    zbMATH DE Number
    6687954
    0 references
    OpenAlex ID
    W2234112207
    0 references
    Wikidata QID
    Q57931583
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q511780&oldid=33231988"
    Powered by MediaWiki