1. Locating sources to meet flow demands in undirected networks;Arata;Journal of Algorithms,2002
2. M. Bárász, J. Becker, A. Frank, An algorithm for source location in directed graphs, EGRES Technical Report no. 2004-06
3. Matroids, submodular functions, and certain polyhedra;Edmonds,1970
4. Computers and Intractability: A Guide to the Theory NP-Completeness;Garey,1979
5. An algorithm for finding a node-subset having high connectivity from other nodes;Honami;IPSJ SIG Notes,1999