Linear-time recognition of Helly circular-arc models and graphs

A circular-arc model M is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then · is a Helly circular-arc model. A (Helly) circular-arc graph is the intersection graph of a (Helly) circular-arc model. Circular-arc graphs and their subclasses have been the objec...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Joeris, B.L., Lin, M.C., McConnell, R.M., Spinrad, J.P., Szwarcfiter, J.L.
Formato: JOUR
Materias:
Algorithms
Circular-arc graphs
Forbidden subgraphs
Helly circular-arc graphs
Arc models
Circular-arc graph
Forbidden induced subgraphs
General class
Intersection graph
Recognition algorithm
Characterization
Graphic methods
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_01784617_v59_n2_p215_Joeris
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares