Performance guarantees and applications for Xia's algorithm

Abstract

AbstractXia's algorithm consists of a reduction algorithm and a translation procedure both originally used to tackle the fixed point property for ordered sets. We present results that show that the translation procedure allows access to a much wider range of problems and results showing that the algorithm is very efficient when applied to the fixed point property in ordered sets or for order/graph isomorphism/rigidity