Author:
Akiba Takuya,Iwata Yoichi,Sameshima Yosuke,Mizuno Naoto,Yano Yosuke
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Subcubic algorithms for Gomory–Hu tree in unweighted graphs;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15