A certifying and dynamic algorithm for the recognition of proper circular-arc graphs

TL;DR

This paper introduces a dynamic algorithm for recognizing proper circular-arc graphs that efficiently handles vertex insertions and removals, providing certification and quick queries for related graph classes.

Contribution

It presents a novel dynamic recognition algorithm for proper circular-arc graphs with certification features and efficient update operations, improving upon existing static methods.

Findings

Supports vertex insertion and removal with efficient time complexity.

Provides certification by outputting minimally non-PCA subgraphs upon failure.

Enables constant-time queries for proper Helly and proper interval graph properties.

Abstract

We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The main feature of the algorithm is that it outputs a minimally non-PCA induced subgraph when the insertion of a vertex fails. Each operation cost $O(\log n + d)$ time, where $n$ is the number vertices and $d$ is the degree of the modified vertex. When removals are disallowed, each insertion is processed in $O(d)$ time. The algorithm also provides two constant-time operations to query if the dynamic graph is proper Helly (PHCA) or proper interval (PIG). When the dynamic graph is not PHCA (resp. PIG), a minimally non-PHCA (resp. non-PIG) induced subgraph is obtained.