On the complexity of crossings in permutations (Q1011761): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.12.088 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029352747 / rank | |||
Normal rank | |||
Revision as of 00:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of crossings in permutations |
scientific article |
Statements
On the complexity of crossings in permutations (English)
0 references
9 April 2009
0 references
crossing minimization
0 references
rank aggregation
0 references
Kendall-\(\tau \) distance
0 references
NP-hardness approximations
0 references
