Improved algorithms for permanent and permanently polynomial of sparse graph

MaRDI QIDQ5403560zbMATH OpenFDO

Authors Baojun Yue, Heng Liang, Fengshan Bai

Publication date 26 March 2014

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph polynomials (05C31)

Recommendations

• A hybrid algorithm for computing permanents of sparse matrices
• An efficient algorithm for computing permanental polynomials of graphs
• Computing permanents via determinants for some classes of sparse matrices
• Calculation of the permanent of a sparse positive matrix
• Efficient computation of the permanent of a sparse matrix

Cited in

(4)

• Calculation of the permanent of a sparse positive matrix
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
• An efficient algorithm for computing permanental polynomials of graphs
• A hybrid algorithm for computing permanents of sparse matrices

This page was built for publication: Improved algorithms for permanent and permanently polynomial of sparse graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403560)