An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter (Q3338283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3871401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter |
scientific article; zbMATH DE number 3871401 |
Statements
An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter (English)
0 references
1984
0 references
communication network
0 references
diameter
0 references
given vertex connectivity
0 references
minimum edges
0 references
0.8070339560508728
0 references
0.786082923412323
0 references
0.7701645493507385
0 references
0.7577127814292908
0 references
0.7538287043571472
0 references
