Computing hypergraph homology
From MaRDI portal
Recommendations
Cites work
- \textsc{Phat} -- persistent homology algorithms toolbox
- Application of hypergraph theory in chemistry
- Betti Numbers of Hypergraphs
- Clear and compress: computing persistent homology in chunks
- Cohomological Aspects of Hypergraphs
- Cohomology of digraphs and (undirected) graphs
- Computational topology. An introduction
- Computing persistent homology
- Computing topological persistence for simplicial maps (extended abstract)
- Discrete Morse theory for computing zigzag persistence
- Distributed computation of persistent homology
- Graph partitioning models for parallel computing
- Graphs associated with simplicial complexes
- Homology of path complexes and hypergraphs
- Javaplex: a research software package for persistent (co)homology
- Morse theory for filtrations and efficient computation of persistent homology
- On the path homology theory of digraphs and Eilenberg-Steenrod axioms
- Persistent cohomology and circular coordinates
- Persistent homology for hypergraphs and computational tools — A survey for users
- Simplification of complexes for persistent homology computations
- The embedded homology of hypergraphs and applications
- The Gudhi library: simplicial complexes and persistent homology
- Topological persistence and simplification
- Zigzag persistence
- Zigzag Persistence via Reflections and Transpositions
- Zigzag persistent homology and real-valued functions
- Zigzag persistent homology in matrix multiplication time
Cited in
(3)
This page was built for publication: Computing hypergraph homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620124)