Coreduction homology algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3587733 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 1256756 (Why is no real title available?)
- scientific article; zbMATH DE number 1961543 (Why is no real title available?)
- scientific article; zbMATH DE number 1390164 (Why is no real title available?)
- scientific article; zbMATH DE number 3205926 (Why is no real title available?)
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- Computational homology
- Computing persistent homology
- Computing the Minimum Fill-In is NP-Complete
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Graph approach to the computation of the homology of continuous maps
- Homology algorithm based on acyclic subspace
- Homology computation by reduction of chain complexes
- Homology of representable sets
- Index pairs algorithms
- On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
- On efficient sparse integer matrix Smith normal form computations
- Topological persistence and simplification
Cited in
(34)- A novel technique for cohomology computations in engineering practice
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- scientific article; zbMATH DE number 7800538 (Why is no real title available?)
- Morse theory for filtrations and efficient computation of persistent homology
- Computing homology
- Allowing cycles in discrete Morse theory
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Homological shape analysis through discrete Morse theory
- Homology of representable sets
- CAPD::RedHom v2 -- homology software based on reduction algorithms
- Discrete Morse theory for computing zigzag persistence
- Homology algorithm based on acyclic subspace
- Coreduction homology algorithm for inclusions and persistent homology
- Conley-Morse-Forman theory for combinatorial multivector fields on Lefschetz complexes
- Coreduction homology algorithm for regular CW-complexes
- 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
- Computing Homology: A Global Reduction Approach
- Simplicial models and topological inference in biological systems
- Reducing complexes in multidimensional persistent homology theory
- A generalized combinatorial marching hypercube algorithm
- The cubical cohomology ring: an algorithmic approach
- Removal operations in \(n\)D generalized maps for efficient homology computation
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
- CW Complexes for Complex Algebraic Surfaces
- Approximation algorithms for Max Morse matching
- Discrete Morse theory for computing cellular sheaf cohomology
- Towards a formal tie between combinatorial and classical vector field dynamics
- An algorithmic discrete gradient field and the cohomology algebra of configuration spaces of two points on complete graphs
- Distributed computation of coverage in sensor networks by homological methods
- On the full, strongly exceptional collections on toric varieties with Picard number three
- Homology in electromagnetic boundary value problems
- Čech type approach to computing homology of maps
- Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
This page was built for publication: Coreduction homology algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006400)
