1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
2. Arata, K., Iwata, S., Makino, K., and Fujishige, S., Locating sources to meet ow demands in undirected networks, manuscript (2000).
3. Downey, R. G. and Fellows, M. R., Parameterized Complexity, Springer (1997).
4. Garey, M. R. and Johnson, D. S., Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman (1979).
5. Honami, S., Ito, H., Uehara, H., and Yokoyama, M., An algorithm for finding a node-subset having high connectivity from other nodes, IPSJ SIG Notes, AL-66, 99, 8, pp. 9–16 (1999). (in Japanese)