Random walks, bisections and gossiping in circulant graphs
From MaRDI portal
Publication:486995
DOI10.1007/s00453-013-9810-3zbMath1306.05227OpenAlexW2056653457MaRDI QIDQ486995
Igor E. Shparlinski, Bernard Mans
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9810-3
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diskrepanz und Distanz von Maßen bezüglich konvexer und Jordanscher Mengen. (Discrepancy and distance of measures with respect to convex and Jordan sets)
- Efficient elections in chordal ring networks
- On Ádám's conjecture for circulant graphs
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes
- Optimal distributed algorithms in unlabeled tori and chordal rings
- The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
- Uniform multi-hop all-to-all optical routings in rings.
- On the spectral Ádám property for circulant graphs
- Diameters of random circulant graphs
- Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
- Random Walks and Bisections in Random Circulant Graphs
- The diameter of a random Cayley graph of ℤ q
- Node bisectors of Cayley graphs
- On small cuts separating an abelian Cayley graph into two equal parts
- Many Random Walks Are Faster Than One
- On the diameter and bisector size of Cayley graphs
- Graphs with circulant adjacency matrices
- LATIN 2004: Theoretical Informatics
- Static frequency assignment in cellular networks
- Gossiping in chordal rings under the line model
This page was built for publication: Random walks, bisections and gossiping in circulant graphs
