Packing directed cycles through a specified vertex set.

Ken-ichi Kawarabayashi Daniel Král'Marek Krcál Stephan 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