Algorithms for compact letter displays: comparison and evaluation (Q1020871)
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 5560190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for compact letter displays: comparison and evaluation |
scientific article; zbMATH DE number 5560190 |
Statements
Algorithms for compact letter displays: comparison and evaluation (English)
0 references
2 June 2009
0 references
multiple pairwise comparison
0 references
line display
0 references
NP-hard problem
0 references
graph problem
0 references
clique cover
0 references
efficient algorithm
0 references
0.6805501580238342
0 references
0.673186719417572
0 references
0.668979287147522
0 references
0.6687226891517639
0 references
