Deepening the (parameterized) complexity analysis of incremental stable matching problems (Q6584015)
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: Deepening the (parameterized) complexity analysis of incremental stable matching problems |
scientific article; zbMATH DE number 7893059
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deepening the (parameterized) complexity analysis of incremental stable matching problems |
scientific article; zbMATH DE number 7893059 |
Statements
Deepening the (parameterized) complexity analysis of incremental stable matching problems (English)
0 references
6 August 2024
0 references
stable marriage
0 references
stable roommates
0 references
adapting to changing preferences
0 references
NP-hardness
0 references
W[1]-hardness
0 references
XP
0 references
FPT
0 references
master lists
0 references
incremental algorithms
0 references
