The matching problem in general graphs is in quasi-NC (Q6946316)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8076697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The matching problem in general graphs is in quasi-NC |
scientific article; zbMATH DE number 8076697 |
Statements
The matching problem in general graphs is in quasi-NC (English)
0 references
6 August 2025
0 references
