scholarly journals Induced disjoint paths in circular-arc graphs in linear time

2016 ◽  
Vol 640 ◽  
pp. 70-83 ◽  
Author(s):  
Petr A. Golovach ◽  
Daniël Paulusma ◽  
Erik Jan van Leeuwen
Keyword(s):  
Linear Time ◽  
Disjoint Paths ◽  
Circular Arc ◽  
Circular Arc Graphs

scholarly journals Isomorphism of graph classes related to the circular-ones property

2013 ◽  
Vol Vol. 15 no. 1 (Discrete Algorithms) ◽  
Author(s):  
Andrew R. Curtis ◽  
Min Chih Lin ◽  
Ross M. Mcconnell ◽  
Yahav Nussbaum ◽  
Francisco Juan Soulignac ◽  
...  
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Circular Arc ◽  
Graph Classes ◽  
Discrete Algorithms ◽  
International Audience ◽  
Related Graph ◽  
Circular Arc Graphs ◽  
Proper Circular Arc Graphs

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.

scholarly journals Linear-Time Recognition of Circular-Arc Graphs

Algorithmica ◽  
2003 ◽  
Vol 37 (2) ◽  
pp. 93-147 ◽  
Author(s):  
Ross M. McConnell
Keyword(s):  
Linear Time ◽  
Circular Arc ◽  
Circular Arc Graphs
Sign in / Sign up

Export Citation Format

Share Document