Distributed and parallel low-diameter decompositions for arbitrary and restricted graphs
From MaRDI portal
Cites work
- A bounding box overlay for competitive routing in hybrid communication networks
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- A tight bound on approximating arbitrary metrics by tree metrics
- Algorithms – ESA 2004
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
- Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Deterministic low-diameter decompositions for weighted graphs and distributed and parallel applications
- Distributed algorithms for low stretch spanning trees
- Distributed algorithms for planar networks. I: Planar embedding
- Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Construction of Light Networks
- Distributed distance computation and routing with small messages
- Distributed strong diameter network decomposition
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Fast Distributed Approximations in Planar Graphs
- Fast partial distance estimation and applications
- Fast routing table construction using small messages (extended abstract)
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. XVI: Excluding a non-planar graph
- Graph theory
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- scientific article; zbMATH DE number 7650073 (Why is no real title available?)
- scientific article; zbMATH DE number 7650398 (Why is no real title available?)
- Improved distributed network decomposition, hitting sets, and spanners, via derandomization
- Light spanners
- Light spanners for high dimensional norms via stochastic decompositions
- Low-Congestion Shortcuts for Graphs Excluding Dense Minors
- Lower-Stretch Spanning Trees
- Minimum cost flow in the CONGEST model
- Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions
- Near-optimal distributed DFS in planar graphs
- Near-optimal distributed maximum flow
- Near-optimal distributed routing with low memory
- Object location using path separators
- On efficient distributed construction of near optimal routing schemes (extended abstract)
- Path Separability of Graphs
- Planar diameter via metric compression
- Property testing of planarity in the \textsf{CONGEST} model
- Routing schemes for hybrid communication networks
- Shortest Paths in a Hybrid Network Model
- Undirected (1+ 𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
- Universally-optimal distributed algorithms for known topologies
- Universally-Optimal Distributed Exact Min-Cut
- Using petal-decompositions to build a low stretch spanning tree
This page was built for publication: Distributed and parallel low-diameter decompositions for arbitrary and restricted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296684)
