Abstract
This is an experimental study of algorithms for the cut tree problem. We study the Gomory–Hu and Gusfield algorithms as well as heuristics aimed to make the former algorithm faster. We develop an efficient implementation of the Gomory–Hu algorithm. We also develop problem families for testing cut tree algorithms. In our tests, the Gomory–Hu algorithm with a right combination of heuristics was significantly more robust than Gusfield's algorithm.
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 callDisclaimer: 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.
