Sublinear time algorithms and complexity of approximate maximum matching (Q6499229)
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: Sublinear time algorithms and complexity of approximate maximum matching |
scientific article; zbMATH DE number 7844589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear time algorithms and complexity of approximate maximum matching |
scientific article; zbMATH DE number 7844589 |
Statements
Sublinear time algorithms and complexity of approximate maximum matching (English)
0 references
8 May 2024
0 references
approximation algorithms
0 references
maximum matching
0 references
sublinear algorithms
0 references
0 references
0 references
0 references
