Algorithms for clique-independent sets on subclasses of circular-arc graphs

Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.

Guardado en:

Detalles Bibliográficos
Autores principales:	Durán, G., Lin, M.C., Mera, S., Szwarcfiter, J.L.
Formato:	Artículo publishedVersion
Lenguaje:	Inglés
Publicado:	2006
Materias:	Algorithms Circular-arc graphs Clique-independent sets Helly circular-arc graphs Computational complexity Computational methods Mathematical models Set theory Graph theory
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1783_Duran
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paperaa:paper_0166218X_v154_n13SPECISS_p1783_Duran
record_format	dspace
spelling	paperaa:paper_0166218X_v154_n13SPECISS_p1783_Duran2023-06-12T16:46:50Z Algorithms for clique-independent sets on subclasses of circular-arc graphs Discrete Appl Math 2006;154(13 SPEC ISS):1783-1790 Durán, G. Lin, M.C. Mera, S. Szwarcfiter, J.L. 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 info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion application/pdf eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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)
language	Inglés
orig_language_str_mv	eng
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, G. Lin, M.C. Mera, S. Szwarcfiter, J.L. 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.
format	Artículo Artículo publishedVersion
author	Durán, G. Lin, M.C. Mera, S. Szwarcfiter, J.L.
author_facet	Durán, G. Lin, M.C. Mera, S. Szwarcfiter, J.L.
author_sort	Durán, G.
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	http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1783_Duran
work_keys_str_mv	AT durang algorithmsforcliqueindependentsetsonsubclassesofcirculararcgraphs AT linmc algorithmsforcliqueindependentsetsonsubclassesofcirculararcgraphs AT meras algorithmsforcliqueindependentsetsonsubclassesofcirculararcgraphs AT szwarcfiterjl algorithmsforcliqueindependentsetsonsubclassesofcirculararcgraphs
_version_	1769810389053210624

Algorithms for clique-independent sets on subclasses of circular-arc graphs

Ejemplares similares