research
∙
08/24/2023
Are there graphs whose shortest path structure requires large edge weights?
The aspect ratio of a weighted graph G is the ratio of its maximum edge ...
share
research
∙
03/01/2023
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights
This paper presents parallel and distributed algorithms for single-sourc...
research
∙
01/17/2023
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method
In the weighted load balancing problem, the input is an n-vertex biparti...
research
∙
07/10/2022
Closing the Gap Between Directed Hopsets and Shortcut Sets
For an n-vertex directed graph G = (V,E), a β-shortcut set H is a set of...
research
∙
07/03/2022
Decremental Matching in General Graphs
We consider the problem of maintaining an approximate maximum integral m...
research
∙
03/07/2022
Negative-Weight Single-Source Shortest Paths in Near-linear Time
We present a randomized algorithm that computes single-source shortest p...
research
∙
01/18/2021
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
In the decremental single-source shortest paths problem, the goal is to ...
research
∙
09/05/2020
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
Let G = (V,E,w) be a weighted, digraph subject to a sequence of adversar...
research
∙
08/10/2020
Improved Bounds for Distributed Load Balancing
In the load balancing problem, the input is an n-vertex bipartite graph ...
research
∙
05/01/2020
Improved Bound for Matching in Random-Order Streams
We study the problem of computing an approximate maximum cardinality mat...
research
∙
04/17/2020
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Designing dynamic graph algorithms against an adaptive adversary is a ma...
research
∙
04/09/2020
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
In the decremental Single-Source Shortest Path problem (SSSP), we are gi...
research
∙
01/11/2019
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time
Computing the Strongly-Connected Components (SCCs) in a graph G=(V,E) is...
research
∙
11/08/2018
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
In the distributed all-pairs shortest paths problem (APSP), every node ...
research
∙
11/05/2018
Towards a Unified Theory of Sparsification for Matching Problems
In this paper, we present a construction of a `matching sparsifier', tha...
research
∙
10/25/2018
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
Many dynamic graph algorithms have an amortized update time, rather than...
research
∙
11/08/2017
