Zhaienhe Zhou

activity

20242026

most citedImproved Decoding of Tanner Codes

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Minimum-Cost $k$ -Arborescence Packing in $O ~ (k m + k^{4} n)$ Time

Zhaienhe Zhou

We give a deterministic, strongly polynomial algorithm running in $O ~ (k m + k^{4} n)$ time that finds $k$ arc-disjoint arborescences of minimum total cost in a directed multigraph…

cs.DS2026

Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm

Thatchaphol Saranurak, Kaiyang Xie, Zhaienhe Zhou

We give the first incremental algorithm for directed global minimum cut. Given a directed graph with $n$ vertices undergoing $m$ edge insertions, our deterministic algorithm explic…

Minimum-Cost k-Arborescence Packing in O~(km+k4n) Time

Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm

Minimum-Cost $k$ -Arborescence Packing in $O ~ (k m + k^{4} n)$ Time