AI Chat AI Image Generator AI Video Text to Speech

Deterministic Weighted Expander Decomposition in Almost-linear Time

06/03/2021

∙

by Jason Li, et al.

∙

∙

In this note, we study the expander decomposition problem in a more general setting where the input graph has positively weighted edges and nonnegative demands on its vertices. We show how to extend the techniques of Chuzhoy et al. (FOCS 2020) to this wider setting, obtaining a deterministic algorithm for the problem in almost-linear time.

Jason Li
55 publications
Thatchaphol Saranurak
49 publications

page 1

page 2

page 3

page 4

research

∙ 06/10/2021

Deterministic Mincut in Almost-Linear Time

We present a deterministic (global) mincut algorithm for weighted, undir...

0 Jason Li, et al. ∙

research

∙ 07/14/2020

Graph Sparsification by Universal Greedy Algorithms

Graph sparsification is to approximate an arbitrary graph by a sparse gr...

0 Ming-Jun Lai, et al. ∙

research

∙ 11/04/2020

Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism

We present implications from the known conjectures like APSP, 3SUM and E...

0 Andrzej Lingas, et al. ∙

research

∙ 12/21/2018

Expander Decomposition and Pruning: Faster, Stronger, and Simpler

We study the problem of graph clustering where the goal is to partition ...

0 Thatchaphol Saranurak, et al. ∙

research

∙ 07/22/2019

Optimal In-place Algorithms for Basic Graph Problems

We present linear time in-place algorithms for several basic and fundam...

0 Sankardeep Chakraborty, et al. ∙

research

∙ 09/09/2020

Deterministic Linear Time Constrained Triangulation using Simplified Earcut

Triangulation algorithms that conform to a set of non-intersecting input...

0 Marco Livesu, et al. ∙

research

∙ 02/13/2021

Almost-linear-time Weighted ℓ_p-norm Solvers in Slightly Dense Graphs via Sparsification

We give almost-linear-time algorithms for constructing sparsifiers with ...

0 Deeksha Adil, et al. ∙