default search action
"Efficiently finding low-sum copies of spanning forests in zero-sum ..."
Johannes Pardey, Dieter Rautenbach (2023)
- Johannes Pardey, Dieter Rautenbach:
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation. Discret. Appl. Math. 328: 108-116 (2023)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.