Improved Algorithm sf or Per manent and Permanental Polynomial of Sparse Graph

A novel algorithm for permanent of sparse graph is proposed, which combines a new permanent expansion formula and graph bisection. Hence the improved algorithm for permental polynomial of sparse graph is followed. Computational results on the permanents and permanental polynomials of fullerene graphs are presented. The new algorithms increase the computable scale for permanents and permanental polynomials dramatically on PC within acceptable time.