Sign in

Packing directed cycles through a specified vertex set.

Ken-ichi KawarabayashiDaniel Král'Marek KrcálStephan Kreutzer
Published in: SODA (2013)
Keyphrases
  • vertex set
  • weighted graph
  • packing problem
  • undirected graph
  • random graphs
  • maximum distance
  • computational complexity
  • image processing
  • reinforcement learning
  • objective function
  • lower bound