Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427)
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 7629137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters |
scientific article; zbMATH DE number 7629137 |
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
0 references
0 references
0 references
0 references
0.994340717792511
0 references
0.8690494298934937
0 references
0.8085191249847412
0 references
0.800788402557373
0 references
