Abstract
This paper presents an algorithm for constructing a cactus representation for all minimum cuts in an undirected network. Our algorithm runs in O(nm + n2 logn + γm logn) time, wheren andm are the number of vertices and edges respectively, and γ is the number of cycles in a cactus representation, which is the one of the best deterministic time complexities to compute a cactus representation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Japan Journal of Industrial and Applied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
