Maximum directed cuts in digraphs with degree restrictionReport as inadecuate




Maximum directed cuts in digraphs with degree restriction - Download this document for free, or read online. Document in PDF available to download.

1 Department of Mathematical Sciences 2 G-SCOP OC - OC G-SCOP - Laboratoire des sciences pour la conception, l-optimisation et la production

Abstract : For integers m,k ≥ 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.





Author: Jenö Lehel - Frédéric Maffray - Myriam Preissmann -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents