Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Guillermo De Ita Luna"'
Publikováno v:
Mathematics, Vol 12, Iss 6, p 922 (2024)
The issue of counting independent sets of a graph, G, represented as i(G), is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics,
Externí odkaz:
https://doaj.org/article/758c0cedc76d453e86bc3cfdecb9c017
Publikováno v:
Revista Colombiana de Computación, Vol 22, Iss 2 (2021)
La comprensión lectora es un proceso que implica la realización de modelos mentales, así como el almacenamiento de recuerdos en la memoria a largo plazo, sí a esto le agregamos que muchos estudiantes requieren acreditar otros idiomas, implica rea
Externí odkaz:
https://doaj.org/article/90d57115f572404ebaa06b715ac76ade
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 42:4719-4726
We present a novel algorithm based on combinatorial operations on lists for computing the number of models on two conjunctive normal form Boolean formulas whose restricted graph is represented by a grid graph Gm,n. We show that our algorithm is corre
Publikováno v:
IEEE Latin America Transactions. 19:1867-1874
The belief revision process involves several problems considered hard. One of the crucial problems is how to represent to the knowledge base K to consider, as well as how to represent and to add new information , which may even be contradictory to th
Publikováno v:
Electronic Notes in Theoretical Computer Science. 354:75-89
We analyze the vertex-coloring problem restricted to planar graphs and propose to consider classic wheels and polyhedral wheels as basic patterns for the planar graphs. We analyze the colorability of the composition among wheels and introduce a novel
Autor:
Jorge E. Gutiérrez-Gómez, Ana E. De Ita-Varela, Guillermo De Ita Luna, Cristina López-Ramírez
Publikováno v:
Electronic Notes in Theoretical Computer Science. 354:91-105
We present an algorithm for the coloring of planar graphs based on the construction of a maximal independent set S of the input graph. The maximal independent set S must fulfill certain characteristics. For example, S contains the vertex that appears
Publikováno v:
Pattern Recognition and Artificial Intelligence ISBN: 9783031092817
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16a6551dd95160d89ebab56bffefd9d8
https://doi.org/10.1007/978-3-031-09282-4_33
https://doi.org/10.1007/978-3-031-09282-4_33
Publikováno v:
IEEE Latin America Transactions. 17:607-614
A novel algorithm is presented for the 3-coloring on parallel-serial graphs. Our proposal is based on the logical specifications (using conjunctive normal forms) of the constraints for a valid 3-coloring of a serial-parallel graph, and afterward, to
Publikováno v:
Computación y Sistemas. 24
Reading comprehension in the English language is a process that has been studied from different disciplines. Many postgraduate programs require certification in another language, hence the importance of seeking semantic patterns that allow the creati
Publikováno v:
Advances in Soft Computing ISBN: 9783030608835
MICAI (1)
MICAI (1)
An \(O(m+n)\) time algorithm is presented for counting the number of models of a two Conjunctive Normal Form Boolean Formula whose constrained graph is represented by a Series-Parallel graph, where n is the number of variables and m is the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb0b79cef96c909a26444349739ac412
https://doi.org/10.1007/978-3-030-60884-2_33
https://doi.org/10.1007/978-3-030-60884-2_33