Percolation and best-choice problem for powers of paths (Q4684858)

From MaRDI portal
Revision as of 15:03, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6943565
Language Label Description Also known as
English
Percolation and best-choice problem for powers of paths
scientific article; zbMATH DE number 6943565

    Statements

    title
    Percolation and best-choice problem for powers of paths (English)
    0 references
    publication date
    26 September 2018
    0 references
    zbMATH Keywords
    site percolation
    0 references
    secretary problem
    0 references
    sequence of graphs
    0 references
    graph power
    0 references
    path
    0 references

    Identifiers

    zbMATH DE Number
    6943565
    0 references
    OpenAlex ID
    W2676169643
    0 references
    DOI
    10.1017/JPR.2017.4
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4684858&oldid=39470671"
    Powered by MediaWiki