Thatchaphol Saranurak
@eigx.bsky.social
Assistant Professor at the University of Michigan.
I design fast graph algorithms in dynamic/distributed/local settings.
https://sites.google.com/site/thsaranurak/
I design fast graph algorithms in dynamic/distributed/local settings.
https://sites.google.com/site/thsaranurak/
I hope this is a good step towards "clarity", an essential goal in science.
This is a joint work with the fantastic team: Aaron Bernstein, Joakim Blikstad, Jason Li, and Ta-Wei Tu.
Joakim and Ta-wei coded up the algorithm.
3/3
This is a joint work with the fantastic team: Aaron Bernstein, Joakim Blikstad, Jason Li, and Ta-Wei Tu.
Joakim and Ta-wei coded up the algorithm.
3/3
October 23, 2025 at 4:47 AM
I hope this is a good step towards "clarity", an essential goal in science.
This is a joint work with the fantastic team: Aaron Bernstein, Joakim Blikstad, Jason Li, and Ta-Wei Tu.
Joakim and Ta-wei coded up the algorithm.
3/3
This is a joint work with the fantastic team: Aaron Bernstein, Joakim Blikstad, Jason Li, and Ta-Wei Tu.
Joakim and Ta-wei coded up the algorithm.
3/3
Both low-level implementation and analysis were previously very involved.
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3
Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
We give a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $\tilde{O}(n^{2}\log U)$ time, which is near-optima...
arxiv.org
October 23, 2025 at 4:47 AM
Both low-level implementation and analysis were previously very involved.
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3