Acquaintance Time of Random Graphs Near Connectivity Threshold (Q2801332)

From MaRDI portal
Revision as of 08:34, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Acquaintance Time of Random Graphs Near Connectivity Threshold
scientific article

    Statements

    title
    Acquaintance Time of Random Graphs Near Connectivity Threshold (English)
    0 references
    author
    Andrzej Dudek
    0 references
    Paweł Prałat
    0 references
    publication date
    7 April 2016
    0 references
    zbMATH Keywords
    random graphs
    0 references
    vertex-pursuit games
    0 references
    acquaintance time
    0 references

    Identifiers

    DOI
    10.1137/140969105
    0 references
    Mathematics Subject Classification ID
    05C80
    0 references
    05C40
    0 references
    05C57
    0 references
    05C65
    0 references
    91A43
    0 references
    68R10
    0 references
    zbMATH DE Number
    6563977
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2801332&oldid=27257452"
    Powered by MediaWiki