Title of article :
Packing directed cycles efficiently Original Research Article
Author/Authors :
Zeev Nutov، نويسنده , , Raphael Yuster، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Abstract :
Let G be a simple digraph. The dicycle packing number of G, denoted image, is the maximum size of a set of arc-disjoint directed cycles in G. Let G be a digraph with a nonnegative arc-weight function image. A function image from the set image of directed cycles in G to image is a fractional dicycle packing of G if image for each image. The fractional dicycle packing number, denoted image, is the maximum value of image taken over all fractional dicycle packings image. In case image we denote the latter parameter by image.
Keywords :
Cycles , Packing , Digraph
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics