Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference23 articles.
1. Scan-first search and sparse certificates—An improved parallel algorithm fork;Cheriyan;SIAM J. Comput.,1993
2. A structure of the system of all minimal cuts of a graph;Dinic,1976
3. Ye. Dinitz, Z. Nutov, A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance, Proceedings, 27nd Symposium on Theory of Computing, 1995.
4. Ye. Dinitz, J. Westbrook, 1995, Maintaining the Classes 4-Edge-Connectivity of a Graph On-Line, Department of Computer Science, Technion, Israel
5. D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, Sparsification—A technique for speeding up dynamic graph algorithms, Proceedings, 33rd Symposium on Foundations of Computer Science, 1992, 60, 69
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Improved Approximations for Relative Survivable Network Design;Approximation and Online Algorithms;2023
2. Deterministic Small Vertex Connectivity in Almost Linear Time;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Computing Vertex-Disjoint Paths in Large Graphs Using MAOs;Algorithmica;2019-07-17
4. Fully dynamic spectral vertex sparsifiers and applications;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
5. Breaking quadratic time for small vertex connectivity and an approximation scheme;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23