A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
From MaRDI portal
Publication:801133
DOI10.1016/0024-3795(84)90030-2zbMath0551.15005OpenAlexW1995854161MaRDI QIDQ801133
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)90030-2
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)
Related Items (8)
Handle bases and bounds on the number of subgraphs ⋮ Comparison of permanental bounds of \((0,1)\)-matrices ⋮ Some upper bounds for permanents of (0, 1)-matrices ⋮ An interpretation of the Dittert conjecture in terms of semi-matchings ⋮ An upper bound for the permanent of a nonnegative matrix ⋮ Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
Cites Work
- Unnamed Item
- Unnamed Item
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- The diagonal equivalence of a nonnegative matrix to a stochastic matrix
- A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations
- A graph theoretical interpretation of nonsymmetric permutation on sparse matrices
- An Upper Bound for the Permanent of a Fully Indecomposable Matrix
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Two Algorithms for Bipartite Graphs
This page was built for publication: A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
