- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Saarbrücken, Universität des Saarlandes, Dissertation, 2017
- Classification
-
Informatik
- Keyword
-
Algorithmus
Geometrie
Topologie
- Event
-
Veröffentlichung
- (where)
-
Saarbrücken
- (who)
-
Saarländische Universitäts- und Landesbibliothek
- (when)
-
2017
- Creator
-
Choudhary, Aruni
- Contributor
-
Mehlhorn, Kurt
- DOI
-
10.22028/D291-26959
- URN
-
urn:nbn:de:bsz:291-scidok-ds-269597
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Choudhary, Aruni
- Mehlhorn, Kurt
- Saarländische Universitäts- und Landesbibliothek
Time of origin
- 2017
Other Objects (12)
On Vietoris-Rips Complexes of Ellipses
Homotopical decompositions of simplicial and Vietoris Rips complexes
Ripser: efficient computation of Vietoris–Rips persistence barcodes
Multi starts at one: Efficient computation of Vietoris–Rips persistence barcodes
Lower Bounds on the Homology of Vietoris–Rips Complexes of Hypercube Graphs
Enhancing the Vietoris–Rips simplicial complex for topological data analysis: applications in cancer gene expression datasets
Approximation algorithms
Approximation Algorithms
Approximation Algorithms
Rips
Karl Vietoris
Leopold Vietoris
On Vietoris-Rips Complexes of Ellipses
Homotopical decompositions of simplicial and Vietoris Rips complexes
Ripser: efficient computation of Vietoris–Rips persistence barcodes
Multi starts at one: Efficient computation of Vietoris–Rips persistence barcodes
Lower Bounds on the Homology of Vietoris–Rips Complexes of Hypercube Graphs
Enhancing the Vietoris–Rips simplicial complex for topological data analysis: applications in cancer gene expression datasets
Approximation algorithms
Approximation Algorithms
Approximation Algorithms
Rips
Karl Vietoris
Leopold Vietoris
On Vietoris-Rips Complexes of Ellipses
Homotopical decompositions of simplicial and Vietoris Rips complexes
Ripser: efficient computation of Vietoris–Rips persistence barcodes
Multi starts at one: Efficient computation of Vietoris–Rips persistence barcodes
Lower Bounds on the Homology of Vietoris–Rips Complexes of Hypercube Graphs
Enhancing the Vietoris–Rips simplicial complex for topological data analysis: applications in cancer gene expression datasets
Approximation algorithms
Approximation Algorithms
Approximation Algorithms
Rips
Karl Vietoris