Efficient computation of the permanent of a sparse matrix

References

• Bax , E. and Joel , F. 1997 . A permanent formula with many zero-valued tenns . Infor. Proc. Lett. , 63 : 33 – 39 .
   Web of Science ®Google Scholar
• Chartrand , G. and Ollerman , R. 1993 . Applied and Algorithmic Graph Theory , New York : McGraw-Hill .
   Google Scholar
• Chen , W.K. 1976 . Applied Graph Theory , North-Holland Publishing Company .
   Google Scholar
• Cushkov , Y.A. 1983 . Graph of Gearing Mechanism , Leningrad .
   Google Scholar
• Marshall , C.W. 1971 . Applied Graph Theory , John Wiley & Sons Inc. .
   Google Scholar
• Rose , D.J. and Willoughby , R.A. 1972 . Sparse Matrices and Its Applications , New York : Plenum Press .
   Google Scholar
• Ryser , H.J. 1963 . Combinatorial Mathematics , John Wiley & Sons .
   Google Scholar
• Saluja , S. 1992 . A note on the permanent value problem . Infor. Proc. Lett. , 43 : 1 – 5 .
   Web of Science ®Google Scholar
• Valiant , L.G. 1979 . The complexity of computing the permanent . Theoret. Comput. Sci. , 8 : 189 – 201 .
   Google Scholar