Simplicial Complexes of Graphs
By Jakob Jonsson. 2007
303 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/71fcbc533d06982d427f6d5c7638d65ed109eeb2
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
In Computational Theory and Mathematics
In Computer Vision and Pattern Recognition
Citations in the corpus
- A roadmap for the computation of persistent homology (2015, methodology): “e takes the distance between nodes in dierent components to be innity). There are many methods 14 to associate an unltered simplicial complex to both undirected and directed networks. See the book [72] for an overview of such methods, and see the paper [71] for an overview of PH for networks. 5.1.2 ”
- On the independence complex of square grids (2006, unknown): “3 in Jonsson’s thesis [6].”