A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
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 fai...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2021 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/173301 |
| Acceso en línea: | http://hdl.handle.net/11336/173301 |
| Access Level: | acceso abierto |
| Palabra clave: | CERTIFYING ALGORITHM DYNAMIC REPRESENTATION PROPER CIRCULAR-ARC GRAPHS PROPER HELLY CIRCULAR-ARC GRAPHS PROPER INTERVAL GRAPH https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
| Sumario: | 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(logn+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. |
|---|