{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T00:26:53Z","timestamp":1774744013463,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319774039","type":"print"},{"value":"9783319774046","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_28","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"376-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Algorithms for Computing a Minimal Homology Basis"],"prefix":"10.1007","author":[{"given":"Tamal K.","family":"Dey","sequence":"first","affiliation":[]},{"given":"Tianqi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yusu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"2","key":"28_CR1","first-page":"58","volume":"8","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Chambers, E.W., Fox, K., Nayyeri, A.: Minimum cycle and homology bases of surface-embedded graphs. J. Comput. Geom. 8(2), 58\u201379 (2017)","journal-title":"J. Comput. Geom."},{"key":"28_CR2","unstructured":"Erickson, J., Whittlesey, K.: Greedy optimal homotopy and homology generators. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1038\u20131046. Society for Industrial and Applied Mathematics (2005)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-31155-0_17","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"O Busaryev","year":"2012","unstructured":"Busaryev, O., Cabello, S., Chen, C., Dey, T.K., Wang, Y.: Annotating simplices with a homology basis and its applications. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 189\u2013200. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_17"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296\u2013303. ACM (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1007\/978-3-540-27836-8_71","volume-title":"Automata, Languages and Programming","author":"T Kavitha","year":"2004","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: A faster algorithm for minimum cycle basis of graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 846\u2013857. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_71"},{"key":"28_CR6","unstructured":"de Pina, J.C.: Applications of shortest path methods. Ph.D. thesis, University of Amsterdam (1995)"},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0216026","volume":"16","author":"JD Horton","year":"1987","unstructured":"Horton, J.D.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput. 16(2), 358\u2013366 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"28_CR8","first-page":"8","volume":"6","author":"K Mehlhorn","year":"2009","unstructured":"Mehlhorn, K., Michail, D.: Minimum cycle bases: faster and simpler. ACM Trans. Algorithms (TALG) 6(1), 8 (2009)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Dey, T.K., Sun, J., Wang, Y.: Approximating loops in a shortest homology basis from point data. In: Proceedings of the Twenty-Sixth Annual Symposium on Computational Geometry, pp. 166\u2013175. ACM (2010)","DOI":"10.1145\/1810959.1810989"},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.comgeo.2009.06.004","volume":"43","author":"C Chen","year":"2010","unstructured":"Chen, C., Freedman, D.: Measuring and computing natural generators for homology groups. Comput. Geom. 43(2), 169\u2013181 (2010)","journal-title":"Comput. Geom."},{"key":"28_CR11","volume-title":"Algebraic Topology","author":"A Hatcher","year":"2002","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-540-70918-3_44","volume-title":"STACS 2007","author":"T Kavitha","year":"2007","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D.: New approximation algorithms for minimum cycle bases of graphs. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 512\u2013523. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70918-3_44"},{"key":"28_CR13","unstructured":"Gleiss, P.M.: Short cycles: minimum cycle bases of graphs from chemistry and biochemistry. Ph.D. thesis, Universit\u00e4t Wien, Austria (2001)"},{"key":"28_CR14","unstructured":"Guskov, I., Wood, Z.J.: Topological noise removal. In: 2001 Graphics Interface Proceedings, Ottawa, Canada, p. 19 (2001)"},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/990002.990007","volume":"23","author":"Z Wood","year":"2004","unstructured":"Wood, Z., Hoppe, H., Desbrun, M., Schr\u00f6der, P.: Removing excess topology from isosurfaces. ACM Trans. Graph. (TOG) 23(2), 190\u2013208 (2004)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Chen, C., Freedman, D.: Hardness results for homology localization. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1594\u20131604. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.129"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1090\/conm\/453\/08802","volume":"453","author":"H Edelsbrunner","year":"2008","unstructured":"Edelsbrunner, H., Harer, J.: Persistent homology-a survey. Contemp. Math. 453, 257\u2013282 (2008)","journal-title":"Contemp. Math."},{"key":"28_CR18","unstructured":"Chen, C., Freedman, D.: Quantifying homology classes. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 1. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2008)"},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480190177042","volume":"7","author":"D Hartvigsen","year":"1994","unstructured":"Hartvigsen, D., Mardon, R.: The all-pairs min cut problem and the minimum cycle basis problem on planar graphs. SIAM J. Discret. Math. 7(3), 403\u2013418 (1994)","journal-title":"SIAM J. Discret. Math."},{"key":"28_CR20","unstructured":"Wulff-Nilsen, C.: Minimum cycle basis and all-pairs min cut of a planar graph in subquadratic time. arXiv preprint arXiv:0912.1208 (2009)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:02:45Z","timestamp":1709827365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}