Skip to main content
Conference Proceedings

Computing multidimensional persistence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5878 LNCS 730-739
DOI: 10.1007/978-3-642-10631-6_74
36Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The theory of multidimensional persistence captures the topology of a multifiltration - a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a polynomial time algorithm for computing multidimensional persistence. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Carlsson, G., Singh, G., & Zomorodian, A. (2009). Computing multidimensional persistence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 730–739). https://doi.org/10.1007/978-3-642-10631-6_74

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free