A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs

A circular-arc model is a circle C together with a collection of arcs of C. If no arc is contained in any other then is a proper circular-arc model, and if some point of C is not covered by any arc then is an interval model. A (proper) (interval) circular-arc graph is the intersection graph of a (pr...

Descripción completa

Detalles Bibliográficos
Autores principales: Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.
Formato: SER
Materias:
Isomorphism problems
Proper circular-arc canonization
Proper circular-arc graphs
Algorithms
BASIC (programming language)
Boolean functions
Computer programming languages
Graph theory
Polynomial approximation
Problem oriented languages
Set theory
Technical presentations
Arc models
Encoding
General classes
Intersection graphs
Interval graphs
Interval models
Linear times
Pca models
Polynomial times
Programming languages
Recognition algorithms
Cavity resonators
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v5124LNCS_n_p355_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares