Coreduction homology algorithm
From MaRDI portal
Publication:1006400
DOI10.1007/S00454-008-9073-YzbMATH Open1163.68041OpenAlexW2021125686MaRDI QIDQ1006400FDOQ1006400
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
Cites Work
- Computing persistent homology
- Topological persistence and simplification
- Graph approach to the computation of the homology of continuous maps
- Computational homology
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Computing the Minimum Fill-In is NP-Complete
- Index pairs algorithms
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- Homology computation by reduction of chain complexes
- On efficient sparse integer matrix Smith normal form computations
- Homology algorithm based on acyclic subspace
- On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
- Homology of representable sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (28)
- Coreduction homology algorithm for regular CW-complexes
- Distributed computation of coverage in sensor networks by homological methods
- Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Homology algorithm based on acyclic subspace
- Computing Homology: A Global Reduction Approach
- On the full, strongly exceptional collections on toric varieties with Picard number three
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
- Title not available (Why is that?)
- Allowing cycles in discrete Morse theory
- Approximation algorithms for Max Morse matching
- Discrete Morse theory for computing zigzag persistence
- Morse theory for filtrations and efficient computation of persistent homology
- A novel technique for cohomology computations in engineering practice
- Discrete Morse theory for computing cellular sheaf cohomology
- Towards a formal tie between combinatorial and classical vector field dynamics
- Automatic generation of cuts on large-sized meshes for the \(T-\Omega \) geometric eddy-current formulation
- Čech type approach to computing homology of maps
- Homological Shape Analysis Through Discrete Morse Theory
- An algorithmic discrete gradient field and the cohomology algebra of configuration spaces of two points on complete graphs
- Conley-Morse-Forman theory for combinatorial multivector fields on Lefschetz complexes
- Reducing complexes in multidimensional persistent homology theory
- Homology in electromagnetic boundary value problems
- Coreduction homology algorithm for inclusions and persistent homology
- Simplicial Models and Topological Inference in Biological Systems
- The cubical cohomology ring: an algorithmic approach
- CW Complexes for Complex Algebraic Surfaces
Uses Software
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)
