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 · 1995
Article A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance Share on Authors: Yefim Dinitz Dept. of Computer Science, Technion, Haifa, Israel Dept. of Computer Science, Technion, Haifa, IsraelView Profile , Zeev Nutov Dept. of Applied Mathematics, Technion, Haifa, Israel Dept. of Applied Mathematics, Technion, Haifa, IsraelView Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995 Pages 509–518https://doi.org/10.1145/225058.225268Online:29 May 1995Publication History 11citation328DownloadsMetricsTotal Citations11Total Downloads328Last 12 Months18Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access