A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance
Author:
Dinitz Yefim,Nutov Zeev
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 2-node-connectivity network design;Theoretical Computer Science;2024-03
2. Minimum+1 (
s, t
)-cuts and Dual-edge Sensitivity Oracle;ACM Transactions on Algorithms;2023-10-14
3. Isolation vulnerability analysis in road network: Edge connectivity and critical link sets;Transportation Research Part D: Transport and Environment;2023-06
4. Improved Approximations for Relative Survivable Network Design;Approximation and Online Algorithms;2023
5. Optimal vertex connectivity oracles;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09