scholarly journals A Simpler Linear-Time Recognition of Circular-Arc Graphs

Author(s):  
Haim Kaplan ◽  
Yahav Nussbaum
2013 ◽  
Vol Vol. 15 no. 1 (Discrete Algorithms) ◽  
Author(s):  
Andrew R. Curtis ◽  
Min Chih Lin ◽  
Ross M. Mcconnell ◽  
Yahav Nussbaum ◽  
Francisco Juan Soulignac ◽  
...  

Discrete Algorithms International audience We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, but works on PC trees, which are unrooted and have a cyclic nature, rather than with PQ trees, which are rooted. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, Γ circular-arc graphs, proper circular-arc graphs and convex-round graphs.


Algorithmica ◽  
2003 ◽  
Vol 37 (2) ◽  
pp. 93-147 ◽  
Author(s):  
Ross M. McConnell

1991 ◽  
Vol 40 (3) ◽  
pp. 123-129 ◽  
Author(s):  
Wen-Lian Hsu ◽  
Kuo-Hui Tsai

2016 ◽  
Vol 640 ◽  
pp. 70-83 ◽  
Author(s):  
Petr A. Golovach ◽  
Daniël Paulusma ◽  
Erik Jan van Leeuwen

Sign in / Sign up

Export Citation Format

Share Document