scientific article; zbMATH DE number 1405680

zbMath0946.05056MaRDI QIDQ4938661

P. R. Subramanya, V. Vinay, Meena Mahajan

Publication date: 18 October 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Pfaffianperfect matchingcombinatorial algorithm

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

The complexity of planarity testing ⋮ Faster combinatorial algorithms for determinant and Pfaffian ⋮ Matchgate shadows for fermionic quantum simulation ⋮ Faster Combinatorial Algorithms for Determinant and Pfaffian ⋮ Counting the number of perfect matchings, and generalized decision trees

This page was built for publication: