Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
{{output}}
Tree-packings - collections of spanning trees of a graph - are a fundamental tool in the study of minimum cut and related graph parameters. They have played a central role in the design of algorithms across static, dynamic, and distributed settings. In this pa... ...