见证!接近线性复杂度的最大流和费用流

P3376 【模板】网络最大流

枫林晚 @ 2022-03-03 10:20:14

2022年3月2日,科研人员给出了接近线性复杂度的最大流和费用流求法(虽然只是Preliminary Version初始版本)。

论文链接:https://arxiv.org/abs/2203.00671

当然,我没看懂233333


by fjy666 @ 2022-03-03 10:21:27

https://www.luogu.com.cn/discuss/414233


by Kobe303 @ 2022-03-03 10:24:27

@fjy666 代码实现有没有给出


by Loser_King @ 2022-03-03 10:31:18

@Kobe303 没有,还在理论阶段


by dd_d @ 2022-03-03 11:20:30

@Kobe303 not practical


by Kobe303 @ 2022-03-03 11:24:28

@dd_d

Stop learning useless algorithms, go and solve some problems, learn how to use binary search.

by Altwilio @ 2022-03-03 11:29:31

只能%


by hjxhjx @ 2022-03-03 11:36:41

看不太懂,只能先%为敬


by H_T_Y @ 2022-11-17 17:16:09

%%%%%%%%%%%%%%%%%%%%%%%%


|