Computing the Homology of Hypergraphs
From MaRDI portal
Publication:6286091
Abstract: Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to compute the homology of the associated simplicial complexes and the embedded homology of hypergraphs as well as some heuristics for efficient computations.
This page was built for publication: Computing the Homology of Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286091)
