Algorithms and complexity of strongly stable non-crossing matchings (Q6132552)
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: Algorithms and complexity of strongly stable non-crossing matchings |
scientific article; zbMATH DE number 7728676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and complexity of strongly stable non-crossing matchings |
scientific article; zbMATH DE number 7728676 |
Statements
Algorithms and complexity of strongly stable non-crossing matchings (English)
0 references
17 August 2023
0 references
stable non-crossing matching
0 references
polynomial time algorithm
0 references
NP-complete
0 references
fixed-parameter tractable (FPT)
0 references
0 references
