NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597): Difference between revisions
From MaRDI portal
Latest revision as of 14:23, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems |
scientific article |
Statements
NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (English)
0 references
1989
0 references
computing the number of perfect matchings
0 references