作者: Yahav Nussbaum , Francisco Juan Soulignac , Jayme Luiz Szwarcfiter , Min Chih Lin , Ross M. Mcconnell
DOI:
关键词:
摘要: We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices obey the circular-ones property. Our is similar to interval graphs of Lueker and Booth, but works on PC trees, which are unrooted have cyclic nature, rather than with PQ rooted. This leads algorithms related graph classes, including Helly circular-arc graphs, Γ proper convex-round graphs.