Finding the KT Partition of a Weighted Graph in Near-Linear Time

Simon Apers, Pawel Gawrychowski, Troy Lee. Finding the KT Partition of a Weighted Graph in Near-Linear Time. In Amit Chakrabarti, Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Volume 245 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.