Unit circular-arc graph representations and feasible circulations

In a recent paper, Duran et al. [J. Algorithms, 58 (2006), pp. 67-78] described an algorithm of complexity O(n2) for recognizing whether a graph G with n vertices and m edges is a unit circular-arc (UCA) graph. Furthermore, the following open questions were posed in the above paper: (i) Is it possib...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Lin, M.C., Szwarcfiter, J.L.
Formato: JOUR
Materias:
Algorithm
Circular-arc graph
Circular-arc model
Circulations
Networks
Proper circular-arc graph
Unit circular-arc graph
Algorithms
Cavity resonators
Graph theory
Paper
Polynomial approximation
Mathematical models
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_08954801_v22_n1_p409_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares