Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Computing minimum weight cycle in the CONGEST model
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in
a graph G=(V, E). This is a fundamental graph problem with classical sequential algorithms …
a graph G=(V, E). This is a fundamental graph problem with classical sequential algorithms …
Quantum complexity of weighted diameter and radius in CONGEST networks
This paper studies the round complexity of computing the weighted diameter and radius of a
graph in the quantum CONGEST model. We present a quantum algorithm that (1+ o (1)) …
graph in the quantum CONGEST model. We present a quantum algorithm that (1+ o (1)) …
Computing replacement paths in the CONGEST model
We present several results on the round complexity of Replacement Paths and Second
Simple Shortest Path which are basic graph problems that can address fault tolerance in …
Simple Shortest Path which are basic graph problems that can address fault tolerance in …
On sparsity awareness in distributed computations
We extract a core principle that underlies seemingly different fundamental distributed
settings, which is that sparsity awareness may induce faster algorithms for core problems in …
settings, which is that sparsity awareness may induce faster algorithms for core problems in …
Distance computations in the hybrid network model via oracle simulations
The Hybrid network model was introduced in [Augustine et al., SODA'20] for laying down a
theoretical foundation for networks which combine two possible modes of communication …
theoretical foundation for networks which combine two possible modes of communication …
On diameter approximation in directed graphs
Computing the diameter of a graph, ie the largest distance, is a fundamental problem that is
central in fine-grained complexity. In undirected graphs, the Strong Exponential Time …
central in fine-grained complexity. In undirected graphs, the Strong Exponential Time …
[PDF][PDF] Improved hardness of approximation of diameter in the CONGEST model
O Grossman, S Khoury, A Paz - 2020 - eprints.cs.univie.ac.at
We study the problem of approximating the diameter D of an unweighted and undirected n-
node graph in the congest model. Through a connection to extremal combinatorics, we show …
node graph in the congest model. Through a connection to extremal combinatorics, we show …
Improved approximation bounds for minimum weight cycle in the congest model
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in
a graph $ G=(V, E) $. This is a fundamental graph problem with classical sequential …
a graph $ G=(V, E) $. This is a fundamental graph problem with classical sequential …
Optimal Distributed Replacement Paths
YJ Chang, Y Chen, D Dey, G Mishra… - arxiv preprint arxiv …, 2025 - arxiv.org
We study the replacement paths problem in the $\mathsf {CONGEST} $ model of distributed
computing. Given an $ s $-$ t $ shortest path $ P $, the goal is to compute, for every edge …
computing. Given an $ s $-$ t $ shortest path $ P $, the goal is to compute, for every edge …
Near optimal bounds for replacement paths and related problems in the congest model
We present several results in the CONGEST model on round complexity for Replacement
Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We …
Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We …