The cover time of the giant component of a random graph (Q3514698): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57401485, #quickstatements; #temporary_batch_1719321775979 |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
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
21 July 2008
0 references
cover time
0 references
random graphs
0 references
giant component
0 references
0 references
