The efficiency of a homology algorithm based on discrete morse theory and coreductions (extended abstract)

Two implementations of a homology algorithm based on the Forman’s discrete Morse theory combined with the coreduction method are presented. Their efficiency is compared with other implementations of homology algorithms.

Detalles Bibliográficos
Autores: Harker, Shaun, Mischaikow, Konstantin, Mrozek, Marian, Nanda, Vidit, Wagner, Hubert, Juda, Mateusz, Dlotko, Pawel
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2010
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/26192
Acceso en línea:http://hdl.handle.net/11441/26192
Access Level:acceso abierto
Palabra clave:Efficient homology algorithms
Discrete Morse theory
Coreductions
Descripción
Sumario:Two implementations of a homology algorithm based on the Forman’s discrete Morse theory combined with the coreduction method are presented. Their efficiency is compared with other implementations of homology algorithms.

Similares en LA Referencia