{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T02:48:11Z","timestamp":1782355691367,"version":"3.54.5"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,27]],"date-time":"2013-07-27T00:00:00Z","timestamp":1374883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00454-013-9529-6","type":"journal-article","created":{"date-parts":[[2013,7,27]],"date-time":"2013-07-27T02:21:27Z","timestamp":1374891687000},"page":"330-353","source":"Crossref","is-referenced-by-count":213,"title":["Morse Theory for Filtrations and Efficient Computation of Persistent Homology"],"prefix":"10.1007","volume":"50","author":[{"given":"Konstantin","family":"Mischaikow","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vidit","family":"Nanda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,7,27]]},"reference":[{"key":"9529_CR1","unstructured":"Carlsson, G.: Topology and data. Bull. Am. Math. Soc. (N.S.) 46(2), 255\u2013308 (2009)"},{"key":"9529_CR2","doi-asserted-by":"crossref","unstructured":"Chari, M.K.: On discrete Morse functions and combinatorial decompositions. In: Proc. Formal Power Series and Algebraic Combinatorics (Vienna) (1997). Discrete Math. 217(1\u20133), 101\u2013113 (2000)","DOI":"10.1016\/S0012-365X(99)00258-7"},{"issue":"1","key":"9529_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00454-006-1276-5","volume":"37","author":"D Cohen-Steiner","year":"2007","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 37(1), 103\u2013120 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9529_CR4","unstructured":"Delfinado, C.J.A., Edelsbrunner, H.: An incremental algorithm for Betti numbers of simplicial complexes on the $$3$$ 3 -sphere: Grid generation, finite elements, and geometric design. Comput. Aided Geom. Des. 12(7), 771\u2013784 (1995)"},{"key":"9529_CR5","doi-asserted-by":"crossref","unstructured":"Dumas, J.-G., Heckenbach, F., Saunders, D., Welker, V.: Computing simplicial homology based on efficient Smith normal form algorithms. In: Joswig, M., Takayama, N. (eds.) Algebra, Geometry, and Software Systems, pp. 177\u2013206. Springer, Berlin (2003)","DOI":"10.1007\/978-3-662-05148-1_10"},{"key":"9529_CR6","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J.: Persistent homology\u2014a survey. In: Surveys on Discrete and Computational Geometry, Contemporary Mathematics, vol. 453, pp. 257\u2013282. American Mathematical Society, Providence (2008)","DOI":"10.1090\/conm\/453\/08802"},{"key":"9529_CR7","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J.L.: Computational Topology. American Mathematical Society, Providence, RI. An introduction (2010)","DOI":"10.1090\/mbk\/069"},{"key":"9529_CR8","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. In: Discrete and Computational Geometry and Graph Drawing (Columbia, SC) (2001). Discrete Comput. Geom. 28(4), 511\u2013533 (2002)"},{"key":"9529_CR9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1006\/aima.1997.1650","volume":"134","author":"R Forman","year":"1998","unstructured":"Forman, R.: Morse theory for cell complexes. Adv. Math. 134, 90\u2013145 (1998)","journal-title":"Adv. Math."},{"key":"9529_CR10","unstructured":"Ghrist, R.: Barcodes: the persistent topology of data. Bull. Am. Math. Soc. (N.S.), 45(1), 61\u201375 (2008)"},{"key":"9529_CR11","unstructured":"Gunther, D., Reininghaus, J., Wagner, H., Hotz, I.: Memory efficient computation of persistent homology for 3d image data using discrete Morse theory. In: Proceedings of Conference on Graphics, Patterns and Images, 24 (to appear)"},{"issue":"6","key":"9529_CR12","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1137\/0220067","volume":"20","author":"J Hafner","year":"1991","unstructured":"Hafner, J., McCurley, K.: Asymptotically fast triangularization of matrices over rings. SIAM J. Comput. 20(6), 1068\u20131083 (1991)","journal-title":"SIAM J. Comput."},{"key":"9529_CR13","unstructured":"Harker, S., Mischaikow, K., Mrozek, M., Nanda, V., Wagner, H., Juda, M., Dlotko, P.: The efficiency of a homology algorithm based on discrete Morse theory and coreductions. In: Proceedings of the 3rd International Workshop on Computational Topology in Image Context, Image A, vol. 1, pp. 41\u201347 (2010)"},{"key":"9529_CR14","author":"S Harker","year":"2013","unstructured":"Harker, S., Mischaikow, K., Mrozek, M., Nanda, V.: Discrete Morse theoretic algorithms for computing homology of complexes and maps. Found. Comput. Math. (2013). doi: 10.1007\/s10208-013-9145-0","journal-title":"Found. Comput. Math."},{"issue":"1","key":"9529_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/S0895480104445885","volume":"20","author":"M Joswig","year":"2006","unstructured":"Joswig, M., Pfetsch, M.: Computing optimal Morse matchings. SIAM J. Discrete Math 20(1), 11\u201325 (2006)","journal-title":"SIAM J. Discrete Math"},{"key":"9529_CR16","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.crma.2005.04.036","volume":"340","author":"D Kozlov","year":"2005","unstructured":"Kozlov, D.: Discrete Morse theory for free chain complexes. C. R. Math. 340, 867\u2013872 (2005)","journal-title":"C. R. Math."},{"key":"9529_CR17","doi-asserted-by":"crossref","unstructured":"Kozlov, D.: Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics, vol. 21. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-71962-5"},{"key":"9529_CR18","doi-asserted-by":"crossref","unstructured":"Lefschetz, S.: Algebraic Topology. American Mathematical Society Colloquium Publications, vol. 27. American Mathematical Society, New York (1942)","DOI":"10.1090\/coll\/027"},{"key":"9529_CR19","unstructured":"Lewiner, T.: Geometric discrete Morse complexes. Ph.D. Dissertation. Department of Mathematics, PUC-Rio. http:\/\/thomas.lewiner.org\/pdfs\/tomlew_phd_puc.pdf (2005)"},{"issue":"3","key":"9529_CR20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1080\/10586458.2003.10504498","volume":"12","author":"T Lewiner","year":"2003","unstructured":"Lewiner, T., Lopes, H., Tavares, G.: Toward optimality in discrete Morse theory. Exp. Math. 12(3), 271\u2013286 (2003)","journal-title":"Exp. Math."},{"key":"9529_CR21","doi-asserted-by":"crossref","unstructured":"Milosavljevic, N., Morozov, D., Skraba, P.: Zigzag persistent homology in matrix multiplication time. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SCG\u201911), pp. 216\u2013225, Paris (2011)","DOI":"10.1145\/1998196.1998229"},{"key":"9529_CR22","volume-title":"Persistence Algorithm Takes Cubic Time in the Worst Case","author":"D Morozov","year":"2005","unstructured":"Morozov, D.: Persistence Algorithm Takes Cubic Time in the Worst Case. BioGeometry News, Department of Computer Science, Duke University, Durham (2005)"},{"key":"9529_CR23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/s00454-008-9073-y","volume":"41","author":"M Mrozek","year":"2009","unstructured":"Mrozek, M., Batko, B.: The coreduction homology algorithm. Discrete Comput. Geom. 41, 96\u2013118 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"10","key":"9529_CR24","doi-asserted-by":"crossref","first-page":"2812","DOI":"10.1016\/j.camwa.2010.09.036","volume":"60","author":"M Mrozek","year":"2010","unstructured":"Mrozek, M., Wanner, T.: Coreduction homology algorithm for inclusions and persistent homology. Comput. Math. Appl. 60(10), 2812\u20132833 (2010)","journal-title":"Comput. Math. Appl."},{"key":"9529_CR25","volume-title":"Elements of Algebraic Topology","author":"JR Munkres","year":"1984","unstructured":"Munkres, J.R.: Elements of Algebraic Topology. The Benjamin\/Cummings Publishing Company, Inc., Menlo Park (1984)"},{"key":"9529_CR26","unstructured":"Perseus, the Persistent Homology Software. http:\/\/www.math.rutgers.edu\/vidit\/perseus"},{"key":"9529_CR27","unstructured":"Robins, V., Wood, P.J., Sheppard, A.P.: Theory and algorithms for constructing discrete Morse complexes from grayscale digital images. IEEE Trans. Pattern Anal. Mach. Intell., 1\u201314 (2010)"},{"key":"9529_CR28","doi-asserted-by":"crossref","unstructured":"Saunders, B.D., Wan, Z.: Smith normal form of dense integer matrices, fast algorithms into practice. In: The International Symposium on Symbolic and Algebraic Computation, pp. 274\u2013281 (2004)","DOI":"10.1145\/1005285.1005325"},{"key":"9529_CR29","volume-title":"Algebraic Topology","author":"EH Spanier","year":"1966","unstructured":"Spanier, E.H.: Algebraic Topology. McGraw-Hill Book Co., New York (1966)"},{"key":"9529_CR30","doi-asserted-by":"crossref","unstructured":"Storjohann, A.: Nearly optimal algorithms for computing Smith normal forms of integer matrices, vol. 96. In: Proceedings of ISSAC, pp. 267\u2013274 (1996)","DOI":"10.1145\/236869.237084"},{"key":"9529_CR31","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13, 354\u2013356 (1969)","journal-title":"Numer. Math."},{"key":"9529_CR32","doi-asserted-by":"crossref","first-page":"92","DOI":"10.2307\/1968689","volume":"37","author":"AW Tucker","year":"1936","unstructured":"Tucker, A.W.: Cell spaces. Ann. Math. 37, 92\u2013100 (1936)","journal-title":"Ann. Math."},{"key":"9529_CR33","doi-asserted-by":"crossref","unstructured":"Wagner, H., Chen, C., Vucini, E.: Efficient computation of persistent homology for cubical data. In: Topological Methods in Data Analysis and Visualization II, pp. 91\u2013106 (2012)","DOI":"10.1007\/978-3-642-23175-9_7"},{"key":"9529_CR34","volume-title":"Topology for Computing, Cambridge Monographs on Applied and Computational Mathematics","author":"A Zomorodian","year":"2005","unstructured":"Zomorodian, A.: Topology for Computing, Cambridge Monographs on Applied and Computational Mathematics, vol. 16. Cambridge University Press, Cambridge, MA (2005)"},{"key":"9529_CR35","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete Comput. Geom. 33(2), 249\u2013274 (2005)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9529-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9529-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9529-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T19:00:22Z","timestamp":1563562822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9529-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,27]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9529"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9529-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,27]]}}}