Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520)

From MaRDI portal
Revision as of 01:10, 5 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
scientific article

    Statements

    Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 January 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    embedding spanning graphs
    0 references
    semi-random graph process
    0 references