A. V. Aho and D. Lee, Efficient algorithms for constructing testing sets, covering paths, and minimum flows, p.159, 1987.

P. Ammann and J. Offutt, Introduction to software testing, 2008.
DOI : 10.1017/CBO9780511809163

P. Ammann, J. Offutt, W. , X. Li, and N. , Coverage computation web applications, 2008.

E. Ciurea and L. Ciupalâ, Sequential and parallel algorithms for minimum flows, Journal of Applied Mathematics and Computing, vol.3, issue.1-2, pp.53-75, 2004.
DOI : 10.1007/BF02935746

G. K. Kaminski, U. Praphamontripong, P. Ammann, and J. Offutt, An evaluation of the minimal-mumcut logic criterion and prime path coverage, Software Engineering Research and Practice, pp.205-211, 2010.

N. Li, F. Li, and J. Offutt, Better Algorithms to Minimize the Cost of Test Paths, 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, pp.280-289, 2012.
DOI : 10.1109/ICST.2012.108

S. C. Ntafos and S. L. Hakimi, On path cover problems in digraphs and applications to program testing. Software Engineering, IEEE Transactions, issue.5, pp.520-529, 1979.