A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
From MaRDI portal
Publication:801134
DOI10.1016/0024-3795(84)90031-4zbMath0551.15006OpenAlexW1998844561MaRDI QIDQ801134
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90031-4
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)
Related Items (4)
Handle bases and bounds on the number of subgraphs ⋮ Comparison of permanental bounds of \((0,1)\)-matrices ⋮ An upper bound for the permanent of a nonnegative matrix ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
Cites Work
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- A graph theoretical interpretation of nonsymmetric permutation on sparse matrices
- Problems Involving Diagonal Products in Nonnegative Matrices
- A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
This page was built for publication: A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
