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...
Guardado en:
| Autor principal: | Lin, Min Chih |
|---|---|
| Publicado: |
2008
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_08954801_v22_n1_p409_Lin http://hdl.handle.net/20.500.12110/paper_08954801_v22_n1_p409_Lin |
| Aporte de: |
Ejemplares similares
-
Unit circular-arc graph representations and feasible circulations
por: Lin, M.C., et al. -
Characterizations and recognition of circular-arc graphs and subclasses: A survey
por: Lin, Min Chih
Publicado: (2009) -
Characterizations and recognition of circular-arc graphs and subclasses: A survey
por: Lin, M.C., et al.
Publicado: (2009) -
Characterizations and recognition of circular-arc graphs and subclasses: A survey
por: Lin, M.C., et al. -
Characterizations and recognition of circular-arc graphs and subclasses: A survey
por: Lin, M.C., et al.
Publicado: (2009)