id paper:paper_0166218X_v154_n13SPECISS_p1783_Duran
record_format dspace
spelling paper:paper_0166218X_v154_n13SPECISS_p1783_Duran2023-06-08T15:15:25Z Algorithms for clique-independent sets on subclasses of circular-arc graphs Durán, Guillermo A. Lin, Min Chih Mera, Sergio Fernando Algorithms Circular-arc graphs Clique-independent sets Helly circular-arc graphs Algorithms Computational complexity Computational methods Mathematical models Set theory Circular-arc graphs Clique-independent sets Helly circular-arc graphs Graph theory Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Lin, M.C. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Mera, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2006 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v154_n13SPECISS_p1783_Duran http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1783_Duran
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Algorithms
Circular-arc graphs
Clique-independent sets
Helly circular-arc graphs
Algorithms
Computational complexity
Computational methods
Mathematical models
Set theory
Circular-arc graphs
Clique-independent sets
Helly circular-arc graphs
Graph theory
spellingShingle Algorithms
Circular-arc graphs
Clique-independent sets
Helly circular-arc graphs
Algorithms
Computational complexity
Computational methods
Mathematical models
Set theory
Circular-arc graphs
Clique-independent sets
Helly circular-arc graphs
Graph theory
Durán, Guillermo A.
Lin, Min Chih
Mera, Sergio Fernando
Algorithms for clique-independent sets on subclasses of circular-arc graphs
topic_facet Algorithms
Circular-arc graphs
Clique-independent sets
Helly circular-arc graphs
Algorithms
Computational complexity
Computational methods
Mathematical models
Set theory
Circular-arc graphs
Clique-independent sets
Helly circular-arc graphs
Graph theory
description Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
author Durán, Guillermo A.
Lin, Min Chih
Mera, Sergio Fernando
author_facet Durán, Guillermo A.
Lin, Min Chih
Mera, Sergio Fernando
author_sort Durán, Guillermo A.
title Algorithms for clique-independent sets on subclasses of circular-arc graphs
title_short Algorithms for clique-independent sets on subclasses of circular-arc graphs
title_full Algorithms for clique-independent sets on subclasses of circular-arc graphs
title_fullStr Algorithms for clique-independent sets on subclasses of circular-arc graphs
title_full_unstemmed Algorithms for clique-independent sets on subclasses of circular-arc graphs
title_sort algorithms for clique-independent sets on subclasses of circular-arc graphs
publishDate 2006
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v154_n13SPECISS_p1783_Duran
http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1783_Duran
work_keys_str_mv AT duranguillermoa algorithmsforcliqueindependentsetsonsubclassesofcirculararcgraphs
AT linminchih algorithmsforcliqueindependentsetsonsubclassesofcirculararcgraphs
AT merasergiofernando algorithmsforcliqueindependentsetsonsubclassesofcirculararcgraphs
_version_ 1768543175953088512