scientific article
From MaRDI portal
Publication:3933016
zbMath0476.05060MaRDI QIDQ3933016
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (28)
A general law of large permanent ⋮ Concentration of permanent estimators for certain large matrices. ⋮ Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems ⋮ An algorithm for calculating the independence and vertex-cover polynomials of a graph ⋮ On a conjecture of Wilf ⋮ Approximating the permanent: A simple approach ⋮ Random path method with pivoting for computing permanents of matrices ⋮ Ramanujan coverings of graphs ⋮ The matching polynomials of hypergraphs and weighted hypergraphs ⋮ A new expression for matching polynomials ⋮ The average Laplacian polynomial of a graph ⋮ The characteristic polynomial and the matchings polynomial of a weighted oriented graph ⋮ Signatures, Lifts, and Eigenvalues of Graphs ⋮ Interlacing families and the Hermitian spectral norm of digraphs ⋮ An efficient algorithm for computing permanental polynomials of graphs ⋮ Open problems in the spectral theory of signed graphs ⋮ Clifford algebras and approximating the permanent ⋮ Non-commutative circuits and the sum-of-squares problem ⋮ On the largest eigenvalue of a mixed graph with partial orientation ⋮ On the matching and permanental polynomials of graphs ⋮ On immanants of Jacobi-Trudi matrices and permutations with restricted position ⋮ An analysis of Monte Carlo algorithm for estimating the permanent ⋮ Spectrahedrality of hyperbolicity cones of multivariate matching polynomials ⋮ A load balancing strategy for parallel computation of sparse permanents ⋮ Noncommutativity makes determinants hard ⋮ On the unimodality of average edge cover polynomials ⋮ Interlacing families. I: Bipartite Ramanujan graphs of all degrees ⋮ Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
This page was built for publication:
