scientific article; zbMATH DE number 2186251

MaRDI QIDQ3023474zbMATH OpenFDO

Authors O. V. Loginov, E. I. Yakovlev

Publication date 5 July 2005

zbMATH Keywords

computational complexityhomology type of a triangulationtopological recognition of a polyhedron

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Homology and cohomology theories in algebraic topology (55N99)

Recommendations

• An algorithm for computing homology groups
• Some computations of algebraic cycle homology
• Computing homology using generalized Gröbner bases
• Efficient algorithms for computing a minimal homology basis
• Discrete Geometry for Computer Imagery
• An algorithm for computing some Heegaard Floer homologies
• scientific article; zbMATH DE number 7760193
• Discrete Morse theoretic algorithms for computing homology of complexes and maps
• A Polynomial Algorithm for Homomorphisms to Oriented Cycles
• A combinatorial method to compute explicit homology cycles using discrete Morse theory

Cited in

(7)

• An algorithm for computing homology groups
• Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
• Computing intersection numbers and bases of cohomology groups for triangulated closed three-dimensional manifolds
• Approximating cycles in a shortest basis of the first homology group from point data
• scientific article; zbMATH DE number 2058536 (Why is no real title available?)
• Minimal 1-cycles generating a canonical basis of 2-manifold's homology group
• Index vector-function and minimal cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3023474)