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]

Authors

Johannes Pardey

This author has not been identified. Look up 'Johannes Pardey' in Google

Dieter Rautenbach

This author has not been identified. Look up 'Dieter Rautenbach' in Google