Random walks, bisections and gossiping in circulant graphs (Q486995): Difference between revisions
From MaRDI portal
Latest revision as of 12:24, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Random walks, bisections and gossiping in circulant graphs |
scientific article |
Statements
Random walks, bisections and gossiping in circulant graphs (English)
0 references
19 January 2015
0 references
bisection
0 references
circulant graphs
0 references
gossiping
0 references
random walks
0 references
random graphs
0 references
0 references