An algorithm for source location in directed graphs

@article{citeulike:1777668, abstract = {A 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[set membership, variant]V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R.}, author = {Barasz, Mihaly and Becker, Johanna and Frank, Andras }, citeulike-article-id = {1777668}, doi = {http://dx.doi.org/10.1016/j.orl.2004.07.005}, journal = {Operations Research Letters}, keywords = {source\_location}, month = {May}, number = {3}, pages = {221--230}, posted-at = {2007-10-17 04:27:38}, priority = {2}, title = {An algorithm for source location in directed graphs}, url = {http://dx.doi.org/10.1016/j.orl.2004.07.005}, volume = {33}, year = {2005} }

TY - JOUR ID - citeulike:1777668 L3 - citeulike-article-id:1777668 TI - An algorithm for source location in directed graphs JF - Operations Research Letters VL - 33 IS - 3 SP - 221 EP - 230 N2 - A 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[set membership, variant]V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R. KW - source_location AU - Barasz, Mihaly AU - Becker, Johanna AU - Frank, Andras PY - 2005/05// UR - http://dx.doi.org/10.1016/j.orl.2004.07.005 ER -