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
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:16, 5 March 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
