Scaling matrices and counting the perfect matchings in graphs
type: Item
instance of: scholarly article
title: Scaling matrices and counting the perfect matchings in graphs
zbMATH Open document ID: 1490.05216
author: Fanny Dufossé
author: Kamer Kaya
author: Ioannis Panagiotas
author: Bora Uçar
published in: Discrete Applied Mathematics
publication date: 2022-01-05T00:00:00Z
full work available at URL: dlpu22.pdf
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05D40
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 7452361
zbMATH Keywords: permanent
zbMATH Keywords: perfect matching
zbMATH Keywords: doubly stochastic matrix
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
OpenAlex ID: W2794797213
cites work: Approximating the permanent via importance sampling with application to the dimer covering problem
cites work: Q5240418
cites work: The university of Florida sparse matrix collection
cites work: Coverings of Bipartite Graphs
cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
cites work: A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: On the complexity of nonnegative-matrix scaling
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: A fast algorithm for matrix balancing
cites work: A Symmetry Preserving Algorithm for Matrix Scaling
cites work: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
cites work: Matching theory
cites work: Computing the block triangular form of a sparse matrix
cites work: Approximating the permanent: A simple approach
cites work: Concerning nonnegative matrices and doubly stochastic matrices
cites work: On counting perfect matchings in general graphs
cites work: Dimer problem in statistical mechanics-an exact result
cites work: The complexity of computing the permanent
DOI: 10.1016/J.DAM.2020.07.016
description: scientific article; zbMATH DE number 7452361