Fast information spreading in graphs with large weak conductance (Q4910571)
From MaRDI portal
!
WARNING
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 6146312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast information spreading in graphs with large weak conductance |
scientific article; zbMATH DE number 6146312 |
Statements
Fast Information Spreading in Graphs with Large Weak Conductance (English)
0 references
19 March 2013
0 references
distributed computing
0 references
randomized algorithms
0 references
weak conductance
0 references
information spreading
0 references
0.9641599655151368
0 references
0.8198232650756836
0 references
0.7874127626419067
0 references
0.7858333587646484
0 references
0.7795494794845581
0 references
