Efficient construction of unit circular-arc models

In a recent paper, Durán, Gravano, McConnell, Spinrad and Tucker described an algorithm of complexity O(n2) for recognizing whether a graph G with n vertices is a unit circular-arc (UCA) graph. Furthermore the following open questions were posed in the above paper: (i) Is it possible to construct a...

Descripción completa

Detalles Bibliográficos
Autores principales: Lin, M.C., Szwarcfiter, J.L.
Formato: CONF
Materias:
Algorithms
Graph theory
Polynomials
Time series analysis
Circular-arc models
Integers
Vertices
Mathematical models
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_NIS07298_v_n_p309_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares