Computing permanents via determinants for some classes of sparse matrices

DOI10.1016/j.laa.2006.01.014zbMath1106.65041OpenAlexW2029903066MaRDI QIDQ852624

Giovanni Resta, Giovanni Sburlati

Publication date: 15 November 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.01.014

zbMATH Keywords

bipartite graphmatrix permanent\((0,1)\) matrixsparse circulant matrix

Mathematics Subject Classification ID

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

Related Items (1)

Flexible manufacturing system selection using a combinatorial mathematics-based decision-making method

Cites Work

• Unnamed Item
• Matchings in graphs on non-orientable surfaces
• Computation of sparse circulant permanents via determinants

This page was built for publication: Computing permanents via determinants for some classes of sparse matrices