An Alternative Implementation for the FPT k-Vertex Cover Parallel Algorithm

Riddley - Notes on the botany of Fernando Noronha.. Desmidiaeeae "in" Symbolae

In this class of graphs, the clique-transversal problem is equivalent to vertex cover, and vertex cover is NP-complete for triangle-free graphs [Pol74]?. Remember that in this

Diante desse contexto, o presente trabalho apresenta a proposta de um modelo de reaproveitamento do óleo de cozinha, para a geração de biodiesel que

This paper studies the existing algorithms of minimum set cover problem and proposes a heuristic approach to solve the problem using modified hill climbing algorithm.. The

A material with pores having similar morphologies and chemical properties as those of the four dipeptides studied in this work, but with significantly higher porosity could,

Capacidade/Incapacidade de realizar actividades exigidas e/ou desejadas –as respostas que descrevem a saúde em termos funcionais, isto é, acções que reflectem o

The association between Afonso Henriques and Saint Francis, and between the history of the Portuguese kingdom and the history of the Franciscan order, and the benevolent protection

An adaptation of the conventional Lanczos algorithm is proposed to solve the general symmetric eigenvalue problem K  λ K G in the case when the geometric