Efficient Processing and Analysis of Circular-Arc Graph Content to Uncover Insights on the Helly Property

Circular-arc graphs, a class of intersection graphs, may not satisfy the Helly property in all their intersection models. The authors investigate the Helly properties of circular-arc graphs, providing algorithms to determine the Helly status of individual cliques and to solve the Helly Cliques problem.