A backtracking algorithm to generate all kernels of a directed graph

References

• Berge , C. 1962 . Graph Theory and its Applications , London : Methuen .
   Google Scholar
• Brown , J.R. 1976 . An Algorithm for r-Bases of a Directed Graph . Networks , 6 : 185 – 188 .
   Google Scholar
• Busacker , R.G. and Saaty , T.L. 1965 . Finite Graphs and Networks , New York : McGraw-Hill .
   Google Scholar
• Hammer , L.P. and Rudeanu , S. 1968 . Pseudoboolean methods in Operations Research , Berlin : Springer- Verlag .
   Google Scholar
• Roberts , F.S. 1978 . Graph Theory and its Applications to Problems of Society . SIAM Regional Conference Series in Applied Mathematics , 29 : 57 – 64 .
   Google Scholar
• Garey , M.R. and Johnson , D.S. 1979 . Computers and Intractability , San Francisco : A Guide to the theory of NP-Completeness .
   Google Scholar
• Knuth , D.E. 1975 . Estimating the Efficiency of Backtrack Programs . Mathematics of -Computation , 29 : 121 – 136 .
   Web of Science ®Google Scholar