It is difficult to tell if there is a Condorcet spanning tree (Q328521)
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 6641432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | It is difficult to tell if there is a Condorcet spanning tree |
scientific article; zbMATH DE number 6641432 |
Statements
It is difficult to tell if there is a Condorcet spanning tree (English)
0 references
20 October 2016
0 references
spanning tree
0 references
Condorcet
0 references
computational complexity
0 references
social choice theory
0 references
0.8865885138511658
0 references
0.8210659623146057
0 references
0.8043985962867737
0 references
0.7978003025054932
0 references
0.7926188111305237
0 references
