Search
Now showing items 1-1 of 1
Efficient Algorithms for Circular-Arc Containment Graphs
(1987)
In the recent past, a wide variety of algorithms have been developed for a class of intersection graphs, called interval graphs. As a generalization of interval graphs, circular-arc graphs have also been studied extensively. ...