scientific article; zbMATH DE number 7053381

zbMath1421.68129MaRDI QIDQ5743505

George Giakkoupis, Thomas Sauerwald

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095245

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Network protocols (68M12)

Related Items

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication, Rumor Spreading with No Dependence on Conductance, Randomized Rumour Spreading: The Effect of the Network Topology, Faster rumor spreading with multiple calls, Asymptotics for push on the complete graph, Rumor spreading with bounded in-degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shortest-path problem for graphs with random arc-lengths
• Eigenvalues and expanders
• Recursive construction for 3-regular expanders
• On certain connectivity properties of the internet topology
• Almost tight bounds for rumour spreading with conductance
• Resource discovery in distributed networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Randomized broadcast in networks
• Expander graphs and their applications
• Rumor Spreading on Random Regular Graphs and Expanders
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
• Fast Distributed Algorithms for Computing Separable Functions
• Rumor Spreading in Social Networks
• On Spreading a Rumor
• Isoperimetric Inequalities for Cartesian Products of Graphs
• Cover Time and Broadcast Time