Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Guillermo De-Ita"'
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:
Computer Sciences & Mathematics Forum, Vol 7, Iss 1, p 28 (2023)
A relevant problem in combinatorial mathematics is the problem of counting independent sets of a graph G, denoted by i(G). This problem has many applications in combinatorics, physics, chemistry and computer science. For example, in statistical physi
Externí odkaz:
https://doaj.org/article/0064a7317086486583840dc9acf2f2db
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
Autor:
Luis Ernesto Sierra-Alva, José Raymundo Marcial Romero, Guillermo De Ita, José Antonio Hernández Servín
Publikováno v:
Programación Matemática y Software, Vol 9, Iss 1 (2017)
En este artículo se presenta un algoritmo para contar las coberturas de aristas de un grafo. El algoritmo, implementado en el lenguaje de programación C++, consiste en dividir el grafo original en subgrafos que cumplan con la propiedad de no tener
Externí odkaz:
https://doaj.org/article/f3418e1654c14a748dbb812687b2c96f
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
Autor:
Guillermo De Ita, Pedro Bello
Publikováno v:
Computación y Sistemas. 26
Publikováno v:
Logic Journal of the IGPL. 28:1130-1140
Counting models for a two conjunctive formula (2-CF) $F$, a problem known as $\sharp $2Sat, is a classic $\sharp $P complete problem. Given a 2-CF $F$ as input, its constraint graph $G$ is built. If $G$ is acyclic, then $\sharp $2Sat($F$) can be comp