Deterministic distributed expander decomposition and routing with applications in distributed derandomization
From MaRDI portal
Cited in
(8)- 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
- O( n)-approximation algorithms for bipartiteness ratio
- Efficient distributed decomposition and routing algorithms in minor-free networks and their applications
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)
