One, Two and Three Times log <i>n</i>/<i>n</i> for Paths in a Complete Graph with Random Weights (Q4719434)
From MaRDI portal
scientific article; zbMATH DE number 1384063
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One, Two and Three Times log <i>n</i>/<i>n</i> for Paths in a Complete Graph with Random Weights |
scientific article; zbMATH DE number 1384063 |
Statements
One, Two and Three Times log <i>n</i>/<i>n</i> for Paths in a Complete Graph with Random Weights (English)
0 references
9 April 2000
0 references
random weighed graphs
0 references
percolation
0 references
