Cover Image

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chang, Yi-Jun, Su, Hsin-Hao
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Deterministic Expander Routing: Faster and More Versatile
by: Chang, Yi-Jun, et al.
Published: (2024)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)

Deterministic Even-Cycle Detection in Broadcast CONGEST
by: Fraigniaud, Pierre, et al.
Published: (2024)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2023)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2022)

Min-Max Correlation Clustering via Neighborhood Similarity
by: Cao, Nairen, et al.
Published: (2025)

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
by: Gall, François Le, et al.
Published: (2018)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
by: Chang, Yi-Jun, et al.
Published: (2023)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
by: Faour, Salwa, et al.
Published: (2025)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
by: Chang, Yi-Jun, et al.
Published: (2024)

Fast Broadcast in Highly Connected Networks
by: Chandra, Shashwat, et al.
Published: (2024)

A Cut-Matching Game for Constant-Hop Expanders
by: Haeupler, Bernhard, et al.
Published: (2022)

Optimal local certification on graphs of bounded pathwidth
by: Baterisna, Dan Alden, et al.
Published: (2025)

Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)

Fully-Distributed Byzantine Agreement in Sparse Networks
by: Augustine, John, et al.
Published: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
by: Laukemann, Jan, et al.
Published: (2024)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
by: Chang, Yi-Jun, et al.
Published: (2023)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

Orientation does not help with 3-coloring a grid in online-LOCAL
by: Boudier, Thomas, et al.
Published: (2025)

Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)

Parallel $k$-Core Decomposition: Theory and Practice
by: Liu, Youzhe, et al.
Published: (2025)

Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
by: Liu, Quanquan C., et al.
Published: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
by: Latypov, Rustam, et al.
Published: (2024)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
by: Gil, Yuval
Published: (2024)

Harmonic Decomposition in Data Sketches
by: Wang, Dingyu
Published: (2024)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
by: Bai, Sirui, et al.
Published: (2024)

Energy-Efficient Maximal Independent Sets in Radio Networks
by: Banasik, Dominick, et al.
Published: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

Can Like Attract Like? A Study of Homonymous Gathering in Networks
by: Devismes, Stéphane, et al.
Published: (2025)

Global certification via perfect hashing
by: Bousquet, Nicolas, et al.
Published: (2024)

Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)