Menú

Listar Científica por autor "HERNANDEZ SERVIN, JOSE ANTONIO"

Ordenar por:Orden:Resultados:

  • Computing the Clique-width of Cactus Graphs 
    MARCIAL ROMERO, JOSE RAYMUNDO; HERNANDEZ SERVIN, JOSE ANTONIO; GONZALEZ RUIZ, JACOBO LEONARDO (ELSEVIER, 2016-01)
    Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. A well known relationship between tree-width and clique-width is that cwd(G) ≤ 3 · 2twd(G)−1. It is also known that tree-width of Cactus ...
  • 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