{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:09:09Z","timestamp":1742947749083,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699002"},{"type":"electronic","value":"9783540699033"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69903-3_31","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"343-354","source":"Crossref","is-referenced-by-count":0,"title":["On a Special Co-cycle Basis of Graphs"],"prefix":"10.1007","author":[{"given":"Telikepalli","family":"Kavitha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"31_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 Bases for Network Graphs. Algorithmica\u00a040(1), 51\u201362 (2004)","journal-title":"Algorithmica"},{"unstructured":"Bunke, F., Hamacher, H.W., Maffioli, F., Schwahn, A.M.: Minimum cut bases in undirected networks Report in Wirtschaftsmathematik 56, Fachbereich Mathematik, TU Kaiserslautern (2007)","key":"31_CR2"},{"unstructured":"de Pina, J.C.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, Netherlands (1995)","key":"31_CR3"},{"issue":"5","key":"31_CR4","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ipl.2007.06.013","volume":"104","author":"M. Elkin","year":"2007","unstructured":"Elkin, M., Liebchen, C., Rizzi, R.: New length bounds for cycle bases. Information Processing Letters, 104(5): 186-193 (2007)","journal-title":"Information Processing Letters"},{"issue":"5","key":"31_CR5","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM, 45(5): 783-797 (1998)","journal-title":"Journal of the ACM"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45471-3_21","volume-title":"Algorithm Theory - SWAT 2002","author":"A. Golynski","year":"2002","unstructured":"Golynski, A., Horton, J.D.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 200\u2013209. Springer, Heidelberg (2002)"},{"key":"31_CR7","first-page":"551","volume":"9","author":"R. Gomory","year":"1961","unstructured":"Gomory, R., Hu, T.C.: Multi-terminal network flows. SIAM Journal on Computing\u00a09, 551\u2013570 (1961)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM Journal on Computing\u00a019(1), 143\u2013155 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","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 Bases in Directed Graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 273\u2013284. Springer, Heidelberg (2006)"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/0216026","volume":"16","author":"J.D. Horton","year":"1987","unstructured":"Horton, J.D.: A polynomial-time algorithm to find a shortest cycle basis of a graph. SIAM Journal on Computing\u00a016, 359\u2013366 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/11523468_23","volume-title":"Automata, Languages and Programming","author":"T. Kavitha","year":"2005","unstructured":"Kavitha, T.: An $\\tilde{O}(m^2n)$ 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, pp. 273\u2013284. Springer, Heidelberg (2005)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s00224-006-1319-6","volume":"40","author":"T. Kavitha","year":"2007","unstructured":"Kavitha, T., Mehlhorn, K.: Algorithms to compute Minimum Cycle Bases in Directed Graphs. Theory of Computing Systems\u00a040, 485\u2013505 (2007)","journal-title":"Theory of Computing Systems"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 Bases of graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 846\u2013857. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Leydold, J., Stadler, P.F.: Minimum cycle bases of outerplanar graphs. Electronic Journal of Combinatorics\u00a05 (1998)","key":"31_CR14","DOI":"10.37236\/1354"},{"key":"31_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, C.: 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)"},{"unstructured":"Liebchen, C., Peeters, L.: On Cyclic Timetabling and Cycles in Graphs. Technical Report 761\/2002, TU Berlin (2002)","key":"31_CR16"},{"issue":"3","key":"31_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":"31_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"},{"doi-asserted-by":"crossref","unstructured":"Rizzi, R.: Minimum Weakly Fundamental Cycle Bases are hard to find. Algorithmica (published online October 2007)","key":"31_CR19","DOI":"10.1007\/s00453-007-9112-8"},{"key":"31_CR20","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming, 2nd edn. Wiley, Chichester (1998)","edition":"2"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney, H.: On the abstract properties of linear dependence. American Journal of Mathematics\u00a057, 509\u2013533 (1935)","journal-title":"American Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69903-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T06:53:51Z","timestamp":1715237631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69903-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699002","9783540699033"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69903-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}