dc.contributor.author | Montoya, J. 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/8974 | |
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 frecuentes de G de un tamaño dado. En el artículo se prueban cotas superiores para algunas restricciones adecuadas del 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/1138/1162 | |
dc.relation.uri | https://revistas.unab.edu.co/index.php/rcc/article/view/1138 | |
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-20 | |
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 2, resultados positivos | |
dc.title.translated | The parametric complexity of mining graphs 2, positive 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 | Research | eng |
dc.subject.keywords | Graph mining | eng |
dc.subject.keywords | Analysis | eng |
dc.subject.keywords | patterns | eng |
dc.subject.keywords | Complexity | eng |
dc.subject.keywords | Turing machines | eng |
dc.subject.keywords | Efficient algorithms | 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 | ] N. Alon, J. Spencer. The Probabilistic Method. Wiley, 2a. edicion, 2000 | |
dc.relation.references | 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-Verlag, 2002 | |
dc.relation.references | 3] V. Dalmau and P. Jonsson. The complexity of counting homomorphism seen from the other
side. Theoretical Computer Science, 329:315-323, 2004 | |
dc.relation.references | ] R. Diestel. Graph Theory. Springer Verlag 200 | |
dc.relation.references | 5] R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999 | |
dc.relation.references | 6] J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM Journal
of Computing, 33(4):892-922, 2004 | |
dc.relation.references | ] J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006 | |
dc.relation.references | 9] M. Grohe. The complexity of homomorphism and constraint satisfaction problem seen from
the other side, Journal of the ACM, 54(1), ó ,2007 | |
dc.relation.references | 0] J. A. Montoya. La complejidad paramÈtrica de minar grafos I, resultados negativos.
Sometido, Revista Colombiana de Computación | |
dc.relation.references | ] R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Boston
MA, 1996. | |
dc.relation.references | ] C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. | |
dc.relation.references | ] S. Toda. P P is as hard as the polynomial-time hierarchy. SIAM Journal on Computing,
20(5):865-877, 1991. | |
dc.subject.lemb | Investigación | spa |
dc.subject.lemb | Minería de grafos | spa |
dc.subject.lemb | Análisis | spa |
dc.subject.lemb | Patrones | spa |
dc.identifier.repourl | repourl:https://repository.unab.edu.co | |
dc.description.abstractenglish | In this paper we analyze the parameterized complexity of graphmining tasks, speciÖcally we analyze the parameterized complexity of the list-ing problem consistent in: Given an input graphG;list the frequent subgraphsofGof a given size. In this paper we prove some upper bounds for suitablerestrictions of this problem. | eng |
dc.subject.proposal | Complejidad | spa |
dc.subject.proposal | Máquinas de turing | spa |
dc.subject.proposal | Algoritmos eficientes | spa |
dc.type.redcol | http://purl.org/redcol/resource_type/CJournalArticle | |
dc.rights.creativecommons | Atribución-NoComercial-SinDerivadas 2.5 Colombia | * |