Maximum directed cuts in digraphs with degree restrictionReportar como inadecuado




Maximum directed cuts in digraphs with degree restriction - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.





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

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



DESCARGAR PDF




Documentos relacionados