Random walks, bisections and gossiping in circulant graphs

DOI10.1007/S00453-013-9810-3zbMATH Open1306.05227OpenAlexW2056653457MaRDI QIDQ486995FDOQ486995

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

zbMATH Keywords

random walksrandom graphscirculant graphsgossipingbisection

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random walks on graphs (05C81)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Many Random Walks Are Faster Than One
• Graphs with circulant adjacency matrices
• Efficient elections in chordal ring networks
• Static frequency assignment in cellular networks
• On Ádám's conjecture for circulant graphs
• Diskrepanz und Distanz von Maßen bezüglich konvexer und Jordanscher Mengen. (Discrepancy and distance of measures with respect to convex and Jordan sets)
• 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
• On the diameter and bisector size of Cayley graphs
• LATIN 2004: Theoretical Informatics
• Gossiping in chordal rings under the line model

Cited In (2)

• The relationship between gossiping in vertex-disjoint paths mode and bisection width
• On reducibility and spectral properties of circulant Markov processes

This page was built for publication: Random walks, bisections and gossiping in circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486995)