The solution space of sorting with recurring comparison faults
Paper i proceeding, 2016

Suppose that n elements shall be sorted by comparisons, but an unknown subset of at most k pairs systematically returns false comparison results. Using a known connection with feedback arc sets in tournaments (FAST), we characterize the solution space of sorting with recurring comparison faults by a FAST enumeration, which represents all information about the order that can be obtained by doing all possible comparisons. An optimal parameterized enumeration algorithm for FAST also works for the more general chordal graphs, and this fact contributes to the efficiency of our representation. Then, we compute the solution space more efficiently, by fault-tolerant versions of Treesort and Quicksort. For rare faults the complexity is close to optimal.

Författare

Peter Damaschke

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science; 27th International Workshop on Combinatorial Algorithms IWOCA 2016, Lecture Notes in Computer Science

Vol. 9843 397-408

Fundament

Grundläggande vetenskaper

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-319-44543-4_31