An optimal competitive algorithm for the minimal clique covering in circular arc graphs

Tytuł:
An optimal competitive algorithm for the minimal clique covering in circular arc graphs
Konferencja:
European Workshop on Computational Geometry [EuroCG]
Rok:
2003

Strony:
48-51