{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:18Z","timestamp":1725488958926},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_3","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T03:29:48Z","timestamp":1187062188000},"page":"13-14","source":"Crossref","is-referenced-by-count":2,"title":["Minimum Cycle Bases in Graphs Algorithms and Applications"],"prefix":"10.1007","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-004-1098-x","volume":"40","author":"F. Berger","year":"2004","unstructured":"Berger, F., Gritzmann, P., de Vries, S.: Minimum cycle basis for network graphs. Algorithmica\u00a040(1), 51\u201362 (2004)","journal-title":"Algorithmica"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Cassell, A.C., Henderson, J.C., Ramachandran, K.: Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method. In: Proc. Royal Society of London Series A, vol.\u00a0350, pp. 61\u201370 (1976)","DOI":"10.1098\/rspa.1976.0095"},{"key":"3_CR3","unstructured":"de Pina, J.C.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, Netherlands (1995)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Elkin, M., Liebchen, Ch., Rizzi, R.: New length bounds for cycle bases. Technical report, TU Berlin (June 2007)","DOI":"10.1016\/j.ipl.2007.06.013"},{"key":"3_CR5","unstructured":"Gotsman, C., Kaligosi, K., Mehlhorn, K., Michail, D., Pyrga, E.: Cycle Basis of Graphs and Sampled Manifolds (submitted for publication)"},{"key":"3_CR6","unstructured":"Gleiss, P.M.: Short Cycles, Minimum Cycle Bases of Graphs from Chemistry and Biochemistry. PhD thesis, Fakult\u00e4t F\u00fcr Naturwissenschaften und Mathematik der Universit\u00e4t Wien (2001)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/11786986_23","volume-title":"Automata, Languages and Programming","author":"R. Hariharan","year":"2006","unstructured":"Hariharan, R., Kavitha, T., Mehlhorn, K.: A Faster Deterministic Algorithm for Minimum Cycle Basis in Directed Graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 250\u2013261. Springer, Heidelberg (2006)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1137\/0216026","volume":"16","author":"J.D. Horton","year":"1987","unstructured":"Horton, J.D.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SICOMP\u00a016, 358\u2013366 (1987)","journal-title":"SICOMP"},{"key":"3_CR9","unstructured":"Kavitha, T.: A simple approximation algorithm for integral bases. personal communication"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"T. Kavitha","year":"2005","unstructured":"Kavitha, T.: An O(m 2 n) randomized algorithm to compute a minimum cycle basis of a directed graph. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, Springer, Heidelberg (2005)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"72","author":"G. Kirchhoff","year":"1847","unstructured":"Kirchhoff, G.: \u00dcber die Aufl\u00f6sung der Gleichungen, auf welche man bei der Untersuchungen der linearen Verteilung galvanischer Str\u00f6me gef\u00fchrt wird. Poggendorf Ann. Phy. Chem.\u00a072, 497\u2013508 (1847)","journal-title":"Poggendorf Ann. Phy. Chem."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 2005","author":"T. Kavitha","year":"2005","unstructured":"Kavitha, T., Mehlhorn, K.: A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, Springer, Heidelberg (2005)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a04393, Springer, Heidelberg (2007)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","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 Bases of Graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, Springer, Heidelberg (2004)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/978-3-540-39658-1_64","volume-title":"Algorithms - ESA 2003","author":"C.. Liebchen.","year":"2003","unstructured":"Liebchen, Ch.: Finding short integral cycle bases for cyclic timetabling. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 715\u2013726. Springer, Heidelberg (2003)"},{"key":"3_CR16","unstructured":"Liebchen, Ch.: Periodic Timetable Optimization in Public Transport. PhD thesis, TU Berlin (2006)"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ipl.2005.01.006","volume":"94","author":"C. Liebchen","year":"2005","unstructured":"Liebchen, C., Rizzi, R.: A greedy approach to compute a minimum cycle basis of a directed graph. Information Processing Letters\u00a094(3), 107\u2013112 (2005)","journal-title":"Information Processing Letters"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.dam.2006.06.007","volume":"155","author":"C. Liebchen","year":"2007","unstructured":"Liebchen, C., Rizzi, R.: Classes of cycle bases. Discrete Applied Mathematics\u00a0155(3), 337\u2013355 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR19","unstructured":"Mehlhorn, K., Michail, D.: Minimum Cycle Bases: Faster and Simpler (submitted for publication)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:28:53Z","timestamp":1619504933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}