The following pages link to (Q3933016):
Displaying 28 items.
- A new expression for matching polynomials (Q409433) (← links)
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph (Q417494) (← links)
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- Ramanujan coverings of graphs (Q1682000) (← links)
- Interlacing families and the Hermitian spectral norm of digraphs (Q1715844) (← links)
- On immanants of Jacobi-Trudi matrices and permutations with restricted position (Q1803873) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- Concentration of permanent estimators for certain large matrices. (Q1879920) (← links)
- On the largest eigenvalue of a mixed graph with partial orientation (Q2041770) (← links)
- On the matching and permanental polynomials of graphs (Q2043349) (← links)
- On the unimodality of average edge cover polynomials (Q2113363) (← links)
- The average Laplacian polynomial of a graph (Q2192129) (← links)
- Spectrahedrality of hyperbolicity cones of multivariate matching polynomials (Q2338625) (← links)
- Noncommutativity makes determinants hard (Q2347802) (← links)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees (Q2352911) (← links)
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem (Q2352912) (← links)
- A general law of large permanent (Q2362303) (← links)
- An algorithm for calculating the independence and vertex-cover polynomials of a graph (Q2383889) (← links)
- On a conjecture of Wilf (Q2384576) (← links)
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems (Q2628330) (← links)
- A load balancing strategy for parallel computation of sparse permanents (Q2864488) (← links)
- Approximating the permanent: A simple approach (Q4286300) (← links)
- Signatures, Lifts, and Eigenvalues of Graphs (Q5126345) (← links)
- Open problems in the spectral theory of signed graphs (Q5198026) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
- Clifford algebras and approximating the permanent (Q5917579) (← links)
- The matching polynomials of hypergraphs and weighted hypergraphs (Q6059085) (← links)
