Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

Michael Elkin, Bernhard Haeupler, Václav Rozhoň, Christoph Grunau

Type: Preprint

Publication Date: 2022-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2204.08254

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications	2022	Václav Rozhoň Michael Elkin Christoph Grunau Bernhard Haeupler
+	Low Diameter Graph Decompositions by Approximate Distance Computation	2020	Ruben Becker Yuval Emek Christoph Lenzen
+	A Simple Deterministic Distributed Low-Diameter Clustering	2022	Václav Rozhoň Bernhard Haeupler Christoph Grunau
+	Low Diameter Graph Decompositions by Approximate Distance Computation	2019	Ruben Becker Yuval Emek Christoph Lenzen
+ PDF Chat	A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs	2016	Matteo Ceccarello Andrea Pietracaprina Geppino Pucci Eli Upfal
+	Strong-Diameter Network Decomposition	2021	Yi‐Jun Chang Mohsen Ghaffari
+	On Diameter Approximation in Directed Graphs	2023	Amir Abboud Mina Dalirrooyfard Ray Li Virginia Vassilevska-Williams
+	Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation	2014	Matteo Ceccarello Andrea Pietracaprina Geppino Pucci Eli Upfal
+ PDF Chat	Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation	2015	Matteo Ceccarello Andrea Pietracaprina Geppino Pucci Eli Upfal
+	Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation	2014	Matteo Ceccarello Andrea Pietracaprina Geppino Pucci Eli Upfal
+	A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs	2015	Matteo Ceccarello Andrea Pietracaprina Geppino Pucci Eli Upfal
+	A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs	2015	Matteo Ceccarello Andrea Pietracaprina Geppino Pucci Eli Upfal
+ PDF Chat	Distributed And Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs	2024	Jinfeng Dou Thorsten Götte Henning Hillebrandt Christian Scheideler Julian Werthmann
+	Approximation Algorithms for Min-Distance Problems	2019	Mina Dalirrooyfard Virginia Vassilevska Williams Nikhil Vyas Nicole Wein Yinzhan Xu Yuancheng Yu
+	Approximation Algorithms for Min-Distance Problems	2019	Mina Dalirrooyfard Virginia Vassilevska Williams Nikhil Vyas Nicole Wein Yinzhan Xu Yuancheng Yu
+	Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1	2023	Vincent Cohen-Addad Hung Lê Marcin Pilipczuk Michał Pilipczuk
+	A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation	2015	Leonid Barenboim Michael Elkin Cyril Gavoille
+	A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation	2015	Leonid Barenboim Michael Elkin Cyril Gavoille
+ PDF Chat	Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*	2023	Vincent Cohen-Addad Hung Lê Marcin Pilipczuk Michał Pilipczuk
+	On Strong Diameter Padded Decompositions	2019	Arnold Filtser

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors