ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1911.05991
  4. Cited By
Graph Spanners in the Message-Passing Model
v1v2 (latest)

Graph Spanners in the Message-Passing Model

Information Technology Convergence and Services (ITCS), 2019
14 November 2019
Manuel Fernández
David P. Woodruff
T. Yasuda
ArXiv (abs)PDFHTML

Papers citing "Graph Spanners in the Message-Passing Model"

3 / 3 papers shown
$(1+ε)$-Approximate Shortest Paths in Dynamic Streams
(1+ε)(1+ε)(1+ε)-Approximate Shortest Paths in Dynamic Streams
Michael Elkin
Chhaya Trehan
99
1
0
28 Jul 2021
Robust Lower Bounds for Graph Problems in the Blackboard Model of
  Communication
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
C. Konrad
Peter Robinson
Viktor Zamaraev
145
2
0
12 Mar 2021
The Local Information Cost of Distributed Graph Spanners
The Local Information Cost of Distributed Graph Spanners
Peter Robinson
196
0
0
22 Mar 2020
1