Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees

Leo van Iersel, Steven Kelk, Nela Lekic +1

A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Pi of the symmetric group S_3. An instance of such a problem consists of a set of variables V a…