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]
@inproceedings{DinitzN95,
title = {A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance},
author = {Yefim Dinitz and Zeev Nutov},
year = {1995},
doi = {10.1145/225058.225268},
url = {http://doi.acm.org/10.1145/225058.225268},
tags = {graph-rewriting, maintenance, rewriting, incremental},
researchr = {https://researchr.org/publication/DinitzN95},
cites = {0},
citedby = {0},
pages = {509-518},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
publisher = {ACM},
}