Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q2109969)
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: Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms |
scientific article |
Statements
Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (English)
0 references
21 December 2022
0 references
0.91512966
0 references
0.87077135
0 references
0.8647698
0 references
0.8524319
0 references
0.84926194
0 references
0.8477851
0 references
0.84229445
0 references
0.83957565
0 references
0.83794725
0 references
