The cover time of the giant component of a random graph (Q3514698): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q228771 / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20201 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4238297225 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57401485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995745 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:41, 28 June 2024

scientific article
Language Label Description Also known as
English
The cover time of the giant component of a random graph
scientific article

    Statements

    The cover time of the giant component of a random graph (English)
    0 references
    0 references
    0 references
    21 July 2008
    0 references
    cover time
    0 references
    random graphs
    0 references
    giant component
    0 references

    Identifiers