Skip to main navigation Skip to search Skip to main content

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

  • Reichman University
  • Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Fingerprint

Dive into the research topics of 'Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics