NP-completeness results for edge modification problems
Fil:Burzyn, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artículo publishedVersion |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1824_Burzyn https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v154_n13SPECISS_p1824_Burzyn_oai |
| Aporte de: |
| id |
I28-R145-paper_0166218X_v154_n13SPECISS_p1824_Burzyn_oai |
|---|---|
| record_format |
dspace |
| spelling |
I28-R145-paper_0166218X_v154_n13SPECISS_p1824_Burzyn_oai2024-08-16 Burzyn, P. Bonomo, F. Durán, G. 2006 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. application/pdf http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1824_Burzyn info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar Discrete Appl Math 2006;154(13 SPEC ISS):1824-1844 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 NP-completeness results for edge modification problems info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v154_n13SPECISS_p1824_Burzyn_oai |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-145 |
| collection |
Repositorio Digital de la Universidad de Buenos Aires (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 |
Artículo Artículo publishedVersion |
| 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 |
| publishDate |
2006 |
| url |
http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n13SPECISS_p1824_Burzyn https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v154_n13SPECISS_p1824_Burzyn_oai |
| work_keys_str_mv |
AT burzynp npcompletenessresultsforedgemodificationproblems AT bonomof npcompletenessresultsforedgemodificationproblems AT durang npcompletenessresultsforedgemodificationproblems |
| _version_ |
1809356901461262336 |