Efficient computation of the permanent of a sparse matrix

DOI10.1080/00207160108805061zbMath0980.65051OpenAlexW2081219400MaRDI QIDQ2740952

Ahmad Al-Kurdi, Ramesh Chand Mittal

Publication date: 10 March 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160108805061

zbMATH Keywords

numerical examplessparse matrixpermanent\((0,1)\)-matricestree theory

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of determinants (65F40)

Related Items (1)

A hybrid algorithm for computing permanents of sparse matrices

Cites Work

• Unnamed Item
• Unnamed Item
• A permanent formula with many zero-valued terms
• The complexity of computing the permanent
• A note on the permanent value problem

This page was built for publication: Efficient computation of the permanent of a sparse matrix