Convexities convexities of paths and geometric

FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico === In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by...

Full description

Bibliographic Details
Main Author: Rafael Teixeira de AraÃjo
Other Authors: Rudini Menezes Sampaio
Format: Others
Language:Portuguese
Published: Universidade Federal do Cearà 2014
Subjects:
Online Access:http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104