NP-completeness results for edge modification problems

Fil:Burzyn, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.

Guardado en:

Detalles Bibliográficos
Autores principales:	Burzyn, P., Bonomo, F., Durán, G.
Formato:	JOUR
Materias:	Computational complexity Edge modification problems Graph classes NP-completeness Algorithms Graph theory Set theory Theorem proving Problem solving
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1824_Burzyn
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	todo:paper_0166218X_v154_n13SPECISS_p1824_Burzyn
record_format	dspace
spelling	todo:paper_0166218X_v154_n13SPECISS_p1824_Burzyn2023-10-03T15:03:34Z NP-completeness results for edge modification problems Burzyn, P. Bonomo, F. Durán, G. Computational complexity Edge modification problems Graph classes NP-completeness Algorithms Computational complexity Graph theory Set theory Theorem proving Edge modification problems Graph classes NP-completeness Problem solving Fil:Burzyn, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1824_Burzyn
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Computational complexity Edge modification problems Graph classes NP-completeness Algorithms Computational complexity Graph theory Set theory Theorem proving Edge modification problems Graph classes NP-completeness Problem solving
spellingShingle	Computational complexity Edge modification problems Graph classes NP-completeness Algorithms Computational complexity Graph theory Set theory Theorem proving Edge modification problems Graph classes NP-completeness Problem solving Burzyn, P. Bonomo, F. Durán, G. NP-completeness results for edge modification problems
topic_facet	Computational complexity Edge modification problems Graph classes NP-completeness Algorithms Computational complexity Graph theory Set theory Theorem proving Edge modification problems Graph classes NP-completeness Problem solving
description	Fil:Burzyn, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
format	JOUR
author	Burzyn, P. Bonomo, F. Durán, G.
author_facet	Burzyn, P. Bonomo, F. Durán, G.
author_sort	Burzyn, P.
title	NP-completeness results for edge modification problems
title_short	NP-completeness results for edge modification problems
title_full	NP-completeness results for edge modification problems
title_fullStr	NP-completeness results for edge modification problems
title_full_unstemmed	NP-completeness results for edge modification problems
title_sort	np-completeness results for edge modification problems
url	http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1824_Burzyn
work_keys_str_mv	AT burzynp npcompletenessresultsforedgemodificationproblems AT bonomof npcompletenessresultsforedgemodificationproblems AT durang npcompletenessresultsforedgemodificationproblems
_version_	1807318183106838528

NP-completeness results for edge modification problems

Ejemplares similares