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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0890-5401(89)90017-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022124805 / rank | |||
Normal rank | |||
Revision as of 22:53, 19 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
