We present a fully dynamic algorithm for the recognition of proper circular-arc (PCA) graphs. The allowed operations on the graph involve the insertion and removal of vertices (together with its incident edges) or edges. Edge operations cost O(log n) time, where n is the number of vertices of the graph, while vertex operations cost O(log n+d) time, where d is the degree of the modified vertex. We also show incremental and decremental algorithms that work in O(1) time per inserted or removed edge. As part of our algorithm, fully dynamic connectivity and co-connectivity algorithms that work in O(log n) time per operation are obtained. Also, an O(Δ) time algorithm for determining if a PCA representation corresponds to a co-bipartite graph is provided, where Δ is the maximum among the degrees of the vertices. When the graph is co-bipartite, a co-bipartition of each of its co-components is obtained within the same amount of time. As an application, we show how to find a minimal forbidden induced subgraph of a static graph in O(n+m) time. © 2013 Springer Science+Business Media New York.
Documento: | Artículo |
Título: | Fully Dynamic Recognition of Proper Circular-Arc Graphs |
Autor: | Soulignac, F.J. |
Filiación: | CONICET, Buenos Aires, Argentina Departamento de Computación, FCEN, Universidad de Buenos Aires, Buenos Aires, Argentina |
Idioma: | Inglés |
Palabras clave: | Co-connectivity; Dynamic recognition; Minimal forbidden induced subgraphs; Proper circular-arc graphs; Round graphs |
Año: | 2013 |
Página de inicio: | 1 |
Página de fin: | 65 |
DOI: | http://dx.doi.org/10.1007/s00453-013-9835-7 |
Título revista: | Algorithmica |
ISSN: | 01784617 |
CODEN: | ALGOE |
Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01784617_v_n_p1_Soulignac |