Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters (Q5875607)
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 7650277
| 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 7650277 |
Statements
3 February 2023
0 references
stable matching
0 references
acceptability graph
0 references
fixed-parameter tractability
0 references
W[1]-hardness
0 references
treewidth
0 references
treedepth
0 references
tree-cut width
0 references
feedback set numbers
0 references
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters (English)
0 references
0.994340717792511
0 references
0.8762907981872559
0 references
0.8059195280075073
0 references
0.8023680448532104
0 references
0.801616370677948
0 references
