MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS (Q4661865)
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 2149340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS |
scientific article; zbMATH DE number 2149340 |
Statements
MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS (English)
0 references
30 March 2005
0 references
graph theory
0 references
average path value
0 references
computer algorithm
0 references
valued graph
0 references
0.6952505111694336
0 references
0.6906871199607849
0 references
0.6757163405418396
0 references
0.6727722883224487
0 references
0.6694909930229187
0 references