NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597)
From MaRDI portal
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
