1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2024
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
Wenyu Jin, Xiaorui Sun, Mikkel Thorup
We present a deterministic fully dynamic algorithm with subpolynomial worst-case time per graph update such that after processing each update of the graph, the algorithm outputs a…
cs.DS2022
Dynamic Kernel Graph Sparsifiers
Yang Cao, Yichuan Deng, Wenyu Jin +4
A geometric graph associated with a set of points and a fixed kernel function $\mathsf{K}:\mathbb{R}^d\times \mathbb{R}^d\to\ma…
cs.DS2020★ 1 cited
Fully Dynamic s-t Edge Connectivity in Subpolynomial Time
Wenyu Jin, Xiaorui Sun
We present a deterministic fully dynamic algorithm to answer -edge connectivity queries on pairs of vertices in worst case update and query time for any positive inte…