3 ms·
And for simplicial complexes there's a neat data structure: https://arxiv.org/abs/2001.02581 https://arxiv.org/abs/2001.02581 It's implemented (minus some feat
by gspr 5y ago
And for simplicial complexes there's a neat data structure: https://arxiv.org/abs/2001.02581 https://arxiv.org/abs/2001.02581
It's implemented (minus some features) in e.g. GUDHI.
- jesuslop 5y agoInteresting and saved. Some time ago I wanted to say that if I can represent a graph as an adjacency matrix, then I would have liked to say that an hypergraph is given by an adjacency tensor. I searched for that but couldn't find any previous work in this line.