The algorithmic complexity of the paired matching problem (Q6899210)
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 8122500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algorithmic complexity of the paired matching problem |
scientific article; zbMATH DE number 8122500 |
Statements
The algorithmic complexity of the paired matching problem (English)
0 references
17 November 2025
0 references
parameterized complexity
0 references
minimum paired matching
0 references
