A new random graph model with self-optimizing nodes: connectivity and diameter (Q4985803)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new random graph model with self-optimizing nodes: connectivity and diameter |
scientific article; zbMATH DE number 7338064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new random graph model with self-optimizing nodes: connectivity and diameter |
scientific article; zbMATH DE number 7338064 |
Statements
A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter (English)
0 references
26 April 2021
0 references
connected Erdős-Rényi random graph
0 references
0 references
0.7598124742507935
0 references
0.7586484551429749
0 references
0.7586410045623779
0 references
0.7458522319793701
0 references
