NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NC algorithms for computing the number of perfect matchings in Kâ,3-free graphs and related problems |
scientific article; zbMATH DE number 4101259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems |
scientific article; zbMATH DE number 4101259 |
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
0.865801215171814
0 references
0.860666036605835
0 references
0.8597994446754456
0 references
