Menú

Listar Conacyt por autor "DE ITA LUNA, GUILLERMO"

Ordenar por:Orden:Resultados:

  • A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas 
    LOPEZ MEDINA, MARCO ANTONIO; MARCIAL ROMERO, JOSE RAYMUNDO; DE ITA LUNA, GUILLERMO; Hernández Servín, José Antonio (Martínez-Villaseñor L., Herrera-Alcántara O., Ponce H., Castro-Espinoza F.A., 2020)
    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 ...
  • A New Optimization Strategy for Solving the Fall-Off Boundary Value Problem in Pixel-Value Di®erencing Steganography 
    Grajeda Marín, Ismael; Hernández Servín, José Antonio; MONTES VENEGAS, HECTOR ALEJANDRO; MARCIAL ROMERO, JOSE RAYMUNDO; MUÑOZ JIMENEZ, VIANNEY; DE ITA LUNA, GUILLERMO (International Journal of Pattern Recognition and Artificial Intelligence, 2018-01-01)
    In Digital Image Steganography, Pixel-Value Di®erencing (PVD) methods use the di®erence between neighboring pixel values to determine the amount of data bits to be inserted. The main advantage of these methods is the size ...
  • Exteding Extremal Polygonal Arrays for the Meriifield-Simmons Index 
    DE ITA LUNA, GUILLERMO; Hernández Servín, José Antonio; MARCIAL ROMERO, JOSE RAYMUNDO; Valdovinos Rosas, Rosa María; Romero Huertas, Marcelo (J. A. Carasco-Ochoa, 2017-06-01)
    Polygonal array graphs have been widely investigated, and they represent a relevant area of interest in mathematical chemistry because they have been used to study intrinsic properties of molecular graphs. For example, to ...
  • Extremsl Polygonal Arrays for the Merrifield-Simmons Index 
    Hernández Servín, José Antonio; MARCIAL ROMERO, JOSE RAYMUNDO; DE ITA LUNA, GUILLERMO (Communications in Mathematical and in Computer Chemistry, 2019-03-01)
    For any polygonal array, independently of the number of sides on each polygon the zig-zag polygonal array has the extremal minimum value for the Merrifield-Simmons index. This result generalises a well known fact obtained ...
  • Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs 
    DE ITA LUNA, GUILLERMO; MARCIAL ROMERO, JOSE RAYMUNDO; HERNANDEZ SERVIN, JOSE ANTONIO (Computación y Sistemas, 2017-01-01)
    A procedure for counting edge covers of simple graphs is presented. The procedure splits simple graphs into non-intersecting cycle graphs. This is a “low exponential” exact algorithm to count edge covers for simple graphs ...
  • The Incremental Satisfiability Problem for a Two Conjunctive Normal Form 
    DE ITA LUNA, GUILLERMO; MARCIAL ROMERO, JOSE RAYMUNDO; HERNANDEZ SERVIN, JOSE ANTONIO (ELSEVIER, 2016-01-01)
    We propose a novel method to review K ⊢ φ when K and φ are both in Conjunctive Normal Forms (CF). We extend our method to solve the incremental satisfiablity problem (ISAT), and we present different cases where ISAT can ...

Buscar en RI


Buscar en RI

Usuario