Mostrar el registro sencillo del ítem
La complejidad paramétrica de minar grafos 1, resultados negativos
dc.contributor.author | Montoya, Juan Andrés | spa |
dc.date.accessioned | 2020-10-27T00:20:49Z | |
dc.date.available | 2020-10-27T00:20:49Z | |
dc.date.issued | 2009-06-01 | |
dc.identifier.issn | 2539-2115 | |
dc.identifier.issn | 1657-2831 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12749/8973 | |
dc.description.abstract | En este artículo analizamos la complejidad paramétrica de algunos problemas típicos en minería de grafos, específicamente nosotros analizamos la complejidad paramétrica del problema de listado consistente en: Dado G un grafo-input, liste todos los subgrafos de G de un tamaño dado. En el artículo se prueban algunas cotas inferiores para este problema. | spa |
dc.format.mimetype | application/pdf | spa |
dc.language.iso | spa | spa |
dc.publisher | Universidad Autónoma de Bucaramanga UNAB | |
dc.relation | https://revistas.unab.edu.co/index.php/rcc/article/view/1137/1161 | |
dc.relation.uri | https://revistas.unab.edu.co/index.php/rcc/article/view/1137 | |
dc.rights | Derechos de autor 2009 Revista Colombiana de Computación | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/co/ | |
dc.source | Revista Colombiana de Computación; Vol. 10 Núm. 1 (2009): Revista Colombiana de Computación; 1-17 | |
dc.subject | Máquinas de Turing | |
dc.subject | Clases de complejidad | |
dc.subject | Complejidad paramétrica | |
dc.subject | Algoritmos eficientes | |
dc.title | La complejidad paramétrica de minar grafos 1, resultados negativos | |
dc.title.translated | The parametric complexity of mining graphs 1, negative results | eng |
dc.type.driver | info:eu-repo/semantics/article | |
dc.type.local | Artículo | spa |
dc.type.coar | http://purl.org/coar/resource_type/c_7a1f | |
dc.subject.keywords | Turing machines | eng |
dc.subject.keywords | Complexity classes | eng |
dc.subject.keywords | Parametric complexity | eng |
dc.subject.keywords | Efficient algorithms | eng |
dc.subject.keywords | Graph mining | eng |
dc.subject.keywords | Computational task | eng |
dc.subject.keywords | Parameterization | eng |
dc.subject.keywords | Problems | eng |
dc.identifier.instname | instname:Universidad Autónoma de Bucaramanga UNAB | spa |
dc.type.hasversion | info:eu-repo/semantics/acceptedVersion | |
dc.rights.accessrights | info:eu-repo/semantics/openAccess | spa |
dc.relation.references | rencias [1] V. Arvind and V. Raman. Approximation algorithms for some parameterized counting problems. In P. Bose and P. Morin, editors, Proceedings of the 13th Annual International Symposium on Algorithms and Computation, Volume 2518 of Lecture Notes in Computer Science, pages 453-464. Springer-V | |
dc.relation.references | 2002. [2] V. Dalmau and P. Jonsson. The complexity of counting homomorphism seen from the other side. Theoretical Computer Science, 329:31 | |
dc.relation.references | [3] R. Diestel. Graph theory. Springer | |
dc.relation.references | [4] R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-V | |
dc.relation.references | [5] J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM Journal of Computing, 33(4):89 | |
dc.relation.references | [6] J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-V | |
dc.relation.references | [7] R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Bosto | |
dc.relation.references | [8] M. Grohe. The complexity of homomorphism and constraint satisfaction problem seen from the other side, Journal of the ACM, 54( | |
dc.relation.references | [9] J. Kobler; U Schoning and J Toran. The Graph isomorphism problem, its structural complexity. Springer V | |
dc.relation.references | [10] C.H. Papadimitriou. Computational Complexity. Addison- | |
dc.relation.references | [11] S. Toda. P P is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20(5):865 | |
dc.contributor.googlescholar | Montoya, Juan Andrés [NWPoQFcAAAAJ] | spa |
dc.contributor.orcid | Montoya, Juan Andrés [0000-0002-9897-3710] | spa |
dc.contributor.researchgate | Montoya, Juan Andrés [Juan-Montoya-23] | spa |
dc.subject.lemb | Máquinas de turing | spa |
dc.subject.lemb | Complejidad paramétrica | spa |
dc.subject.lemb | Algoritmos eficientes | spa |
dc.subject.lemb | Investigación | spa |
dc.identifier.repourl | repourl:https://repository.unab.edu.co | |
dc.description.abstractenglish | In this article we analyze the parametric complexity of some typical problems in graph mining, specifically we analyze the parametric complexity of the listing problem consisting of: Given G an input-graph, list all subgraphs of G of a given size. The article tests some lower bounds for this problem. | eng |
dc.subject.proposal | Minería de grafos | spa |
dc.subject.proposal | Tarea computacional | spa |
dc.subject.proposal | Parametrización | spa |
dc.subject.proposal | Problemas | spa |
dc.type.redcol | http://purl.org/redcol/resource_type/CJournalArticle | |
dc.rights.creativecommons | Atribución-NoComercial-SinDerivadas 2.5 Colombia | * |