Bárász, MihályBecker, JohannaFrank, András2006-02-132006-02-132006-02-13200410.1016/j.orl.2004.07.005https://infoscience.epfl.ch/handle/20.500.14299/223077A polynomial time solution algorithm is described to find a smallest subset R of nodes of a directed graph D=(V,A) such that, for every node v in V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R.Source locationEdge-connectivityPolynomial algorithmtext::journal::journal article::research article