Computing minimum weight cycle in the CONGEST model
From MaRDI portal
Cites work
- \((1+\varepsilon)\)-approximate shortest paths in dynamic streams
- A faster distributed single-source shortest paths algorithm
- A Randomized Parallel Algorithm for Single-Source Shortest Paths
- Algorithmic trade-offs for girth approximation in undirected graphs
- An information statistics approach to data stream and communication complexity
- An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem
- Approximating the girth
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Brief Announcement
- Distributed algorithms for network diameter and girth
- Distributed approximation algorithms for weighted shortest paths
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Cycle Detection and Removal
- Distributed distance computation and routing with small messages
- Distributed exact weighted all-pairs shortest paths in \(\widetilde{O}(n^{5/4})\) rounds
- Distributed exact weighted all-pairs shortest paths in near-linear time
- Distributed verification and hardness of distributed approximation
- Even-cycle detection in the randomized and quantum CONGEST model
- Fast distributed algorithms for girth, cycles and small subgraphs
- Fine-grained complexity for sparse graphs
- Hopsets with constant hopbound, and applications to approximate shortest paths
- scientific article; zbMATH DE number 7788357 (Why is no real title available?)
- Improved girth approximation in weighted undirected graphs
- Improved roundtrip spanners, emulators, and directed girth approximation
- Near-linear lower bounds for distributed distance computations, even in sparse networks
- Near-optimal Distributed Triangle Enumeration via Expander Decompositions
- Near-optimal scheduling of distributed algorithms
- Networks cannot compute their diameter in sublinear time
- On the distributional complexity of disjointness
- On the power of the congested clique model
- Optimal distributed all pairs shortest paths and applications
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
- Parallel exact shortest paths in almost linear work and square root depth
- Single-source shortest paths in the CONGEST model with improved bounds
- Subcubic equivalences between path, matrix, and triangle problems
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Triangle Finding and Listing in CONGEST Networks
This page was built for publication: Computing minimum weight cycle in the CONGEST model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971957)
