A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance

Yefim Dinitz, Zeev Nutov. A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 509-518, ACM, 1995. [doi]

Authors

Yefim Dinitz

This author has not been identified. Look up 'Yefim Dinitz' in Google

Zeev Nutov

This author has not been identified. Look up 'Zeev Nutov' in Google