Login / Signup

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

Johannes PardeyDieter Rautenbach
Published in: Discret. Appl. Math. (2023)
Keyphrases
  • conditional expectation
  • incomplete information
  • game theory
  • neural network
  • lower bound
  • probability distribution