Comparing and Aggregating Partial Orders with Kendall Tau Distances

DOI10.1007/978-3-642-28076-4_11zbMath1294.06001OpenAlexW84142378MaRDI QIDQ2889903

Andreas Gleißner, Andreas Hofmeier, Franz-Josef Brandenburg

Publication date: 8 June 2012

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28076-4_11

Mathematics Subject Classification ID

Partial orders, general (06A06) Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders ⋮ Beyond rankings: comparing directed acyclic graphs

This page was built for publication: Comparing and Aggregating Partial Orders with Kendall Tau Distances