Polar permutation graphs are polynomial-time recognisable

Tinaz Ekim, Pinar Heggernes, Daniel Meister. Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb., 34(3):576-592, 2013. [doi]

Abstract

Abstract is missing.