Deterministic distributed expander decomposition and routing with applications in distributed derandomization

DOI10.1109/FOCS46700.2020.00043MaRDI QIDQ6944013zbMATH OpenFDO

Authors Thatchaphol Saranurak, Yi-Jun Chang

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00043

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• Edge-disjoint paths in expanders: online with removals
• Fast approximate counting of cycles
• Brief announcement: Low-distortion clustering in bounded growth graphs
• Deterministic expander routing: faster and more versatile
• Distributed subgraph finding: progress and challenges (invited talk)
• Length-constrained directed expander decomposition and length-constrained vertex-capacitated flow shortcuts

This page was built for publication: Deterministic distributed expander decomposition and routing with applications in distributed derandomization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944013)