Neighborhood hypergraph model for topological data analysis
From MaRDI portal
Publication:2111089
Recommendations
Cites work
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 1342089 (Why is no real title available?)
- scientific article; zbMATH DE number 1555260 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Combinatorial algebraic topology
- Computing persistent homology
- Correlation clustering in general weighted graphs
- Kneser's conjecture, chromatic number, and homotopy
- Networks beyond pairwise interactions: structure and dynamics
- On sparse spanners of weighted graphs
- PERSISTENCE BARCODES FOR SHAPES
- Parallel algorithms for geometric graph problems
- Persistent Laplacians: properties, algorithms and implications
- The de Rham-Hodge analysis and modeling of biomolecules
- The embedded homology of hypergraphs and applications
- The neighborhood complex of a random graph
- Topology and data
Cited in
(4)
This page was built for publication: Neighborhood hypergraph model for topological data analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111089)