Automedian sets of permutations: direct sum and shuffle

DOI10.1016/j.tcs.2020.11.022zbMath1482.05005OpenAlexW3108864434MaRDI QIDQ2220835

Charles Desharnais, Sylvie Hamel

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.022

zbMATH Keywords

shuffledirect sumsets of permutationsKendall-\(\tau\) distanceautomediandecomposable and separable sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments with Kemeny ranking: What works when?
• Average parameterization and partial kernelization for computing medians
• Exploring the median of permutations problem
• Permutations, matrices, and generalized Young tableaux
• Parameterized Enumeration of (Locally-) Optimal Aggregations
• Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
• Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
• Improved Parameterized Algorithms for the Kemeny Aggregation Problem
• Rank Aggregation: Together We're Strong
• A NEW MEASURE OF RANK CORRELATION
• Graph Drawing
• Aggregating inconsistent information

This page was built for publication: Automedian sets of permutations: direct sum and shuffle