{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T04:55:34Z","timestamp":1783832134509,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_23","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"250-261","source":"Crossref","is-referenced-by-count":10,"title":["A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs"],"prefix":"10.1007","author":[{"given":"Ramesh","family":"Hariharan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Introduction to Analytic Number Theory","author":"T.M. Apostol","year":"1997","unstructured":"Apostol, T.M.: Introduction to Analytic Number Theory. Springer, Heidelberg (1997)"},{"issue":"1","key":"23_CR2","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"},{"key":"23_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol.\u00a0184. Springer, Berlin (1998)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1098\/rspa.1976.0095","volume":"350","author":"A.C. Cassell","year":"1976","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. Proc. Royal Society of London Series A\u00a0350, 61\u201370 (1976)","journal-title":"Proc. Royal Society of London Series A"},{"key":"23_CR5","unstructured":"de Pina, J.C.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, Netherlands (1995)"},{"key":"23_CR6","series-title":"Prentice-Hall Series in Automatic Computation","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"N. Deo","year":"1982","unstructured":"Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Englewood Cliffs (1982)"},{"key":"23_CR7","unstructured":"Gleiss, P.M.: Short cycles: minimum cycle bases of graphs from chemistry and biochemistry. PhD thesis, Universit\u00e4t Wien (2001)"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.7151\/dmgt.1200","volume":"23","author":"P.M. Gleiss","year":"2003","unstructured":"Gleiss, P.M., Leydold, J., Stadler, P.F.: Circuit bases of strongly connected digraphs. Discussiones Math. Graph Th.\u00a023, 241\u2013260 (2003)","journal-title":"Discussiones Math. Graph Th."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Golynski, A., Horton, J.D.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In: 8th Scandinavian Workshop on Algorithm Theory (2002)","DOI":"10.1007\/3-540-45471-3_21"},{"key":"23_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 of Computing\u00a016, 359\u2013366 (1987)","journal-title":"SIAM Journal of Computing"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11523468_23","volume-title":"Automata, Languages and Programming","author":"T. Kavitha","year":"2005","unstructured":"Kavitha, T.: An \u00d5(m\n                           2\n                           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, pp. 273\u2013284. Springer, Heidelberg (2005)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-540-31856-9_54","volume-title":"STACS 2005","author":"T. Kavitha","year":"2005","unstructured":"Kavitha, T., Mehlhorn, K.: Algorithms to compute Minimum Cycle Bases in Directed Graphs. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 654\u2013665. Springer, Heidelberg (2005)"},{"key":"23_CR13","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 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)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"23_CR15","unstructured":"Liebchen, C., Peeters, L.: On Cyclic Timetabling and Cycles in Graphs. Technical Report 761\/, TU Berlin (2002)"},{"issue":"3","key":"23_CR16","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"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:32:32Z","timestamp":1558308752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11786986_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}