Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation

Johannes Pardey, Dieter Rautenbach. Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation. Discrete Applied Mathematics, 328:108-116, March 2023. [doi]

Abstract

Abstract is missing.