Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q175575 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Rolf Niedermeier / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2990125763 / rank | |||
Normal rank | |||
Latest revision as of 00:25, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters |
scientific article |
Statements
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (English)
0 references
8 December 2022
0 references
stable matching
0 references
fixed-parameter tractability
0 references
W[1]-hardness
0 references
tree-cut width
0 references
disjoint path modulator
0 references
