Coreduction homology algorithm
From MaRDI portal
Publication:1006400
DOI10.1007/s00454-008-9073-yzbMath1163.68041OpenAlexW2021125686MaRDI QIDQ1006400
Publication date: 24 March 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-008-9073-y
Related Items
Approximation algorithms for Max Morse matching ⋮ Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\) ⋮ CW Complexes for Complex Algebraic Surfaces ⋮ Discrete Morse theory for computing cellular sheaf cohomology ⋮ Towards a formal tie between combinatorial and classical vector field dynamics ⋮ Allowing cycles in discrete Morse theory ⋮ Morse theory for filtrations and efficient computation of persistent homology ⋮ Čech type approach to computing homology of maps ⋮ The cubical cohomology ring: an algorithmic approach ⋮ Discrete Morse theoretic algorithms for computing homology of complexes and maps ⋮ Conley-Morse-Forman theory for combinatorial multivector fields on Lefschetz complexes ⋮ Coreduction homology algorithm for inclusions and persistent homology ⋮ Homological Shape Analysis Through Discrete Morse Theory ⋮ Coreduction homology algorithm for regular CW-complexes ⋮ Computing multiparameter persistent homology through a discrete Morse-based approach ⋮ On the full, strongly exceptional collections on toric varieties with Picard number three ⋮ Homology in electromagnetic boundary value problems ⋮ Unnamed Item ⋮ A novel technique for cohomology computations in engineering practice ⋮ Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation ⋮ Automatic generation of cuts on large-sized meshes for the \(T-\Omega \) geometric eddy-current formulation ⋮ Homology algorithm based on acyclic subspace ⋮ Distributed computation of coverage in sensor networks by homological methods ⋮ Discrete Morse theory for computing zigzag persistence ⋮ Reducing complexes in multidimensional persistent homology theory ⋮ Simplicial Models and Topological Inference in Biological Systems ⋮ Computing Homology: A Global Reduction Approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On efficient sparse integer matrix Smith normal form computations
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- Index pairs algorithms
- Homology algorithm based on acyclic subspace
- Homology computation by reduction of chain complexes
- On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
- Computational homology
- Computing persistent homology
- Topological persistence and simplification
- Graph approach to the computation of the homology of continuous maps
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Homology of representable sets
- Computing the Minimum Fill-In is NP-Complete
This page was built for publication: Coreduction homology algorithm
