{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:54:38Z","timestamp":1725486878799},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72845-0_28","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T08:51:37Z","timestamp":1182847897000},"page":"365-378","source":"Crossref","is-referenced-by-count":1,"title":["Benchmarks for Strictly Fundamental Cycle Bases"],"prefix":"10.1007","author":[{"given":"Christian","family":"Liebchen","sequence":"first","affiliation":[]},{"given":"Gregor","family":"W\u00fcnsch","sequence":"additional","affiliation":[]},{"given":"Ekkehard","family":"K\u00f6hler","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Reich","sequence":"additional","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N. Alon","year":"1995","unstructured":"Alon, N., Karp, R.M., Peleg, D., West, D.B.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput.\u00a024(1), 78\u2013100 (1995)","journal-title":"SIAM J. Comput."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-540-24838-5_2","volume-title":"Experimental and Efficient Algorithms","author":"E. Amaldi","year":"2004","unstructured":"Amaldi, E., Liberti, L., Maculan, N., Maffioli, F.: Efficient edge-swapping heuristics for finding minimum fundamental cycle bases. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 14\u201329. Springer, Heidelberg (2004)"},{"key":"28_CR3","unstructured":"B\u00e4chle, S., Ebert, F.: Graph theoretical algorithms for index reduction in circuit simulation. Preprint 245, DFG Research Center Matheon (2005)"},{"issue":"1-2","key":"28_CR4","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern.\u00a011(1-2), 1\u201322 (1993)","journal-title":"Acta Cybern."},{"key":"28_CR5","unstructured":"Boksberger, P.: Minimum stretch spanning trees. Diploma thesis, ETH\u00a0Z\u00fcrich (2003)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Local Area Networks: An Advanced Course","author":"B. Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. In: Hutchison, D., Shepherd, W.D., Mariani, J.A. (eds.) Local Area Networks: An Advanced Course. LNCS, vol.\u00a0184, Springer, Heidelberg (2002) (2nd printing)"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/355984.355988","volume":"8","author":"N. Deo","year":"1982","unstructured":"Deo, N., Krishnomoorthy, M., Prabhu, G.: Algorithms for generating fundamental cycles in a graph. ACM Transactions on Mathematical Software\u00a08(1), 26\u201342 (1982)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"28_CR8","first-page":"141","volume":"107","author":"N. Deo","year":"1995","unstructured":"Deo, N., Kumar, N., Parsons, J.: Minimum-length fundamental cycle set: New heuristics and an empirical study. Congressus Numerantium\u00a0107, 141\u2013154 (1995)","journal-title":"Congressus Numerantium"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1145\/1060590.1060665","volume-title":"STOC","author":"M. Elkin","year":"2005","unstructured":"Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 494\u2013503. ACM Press, New York (2005)"},{"key":"28_CR10","unstructured":"Gleiss, P.M.: Short Cycles. Ph.D. thesis, Universit\u00e4t Wien (2001)"},{"issue":"12","key":"28_CR11","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1145\/363848.363861","volume":"10","author":"C.C. Gotlieb","year":"1967","unstructured":"Gotlieb, C.C., Corneil, D.G.: Algorithms for finding a fundamental set of cycles for an undirected linear graph. Communications of the ACM\u00a010(12), 780\u2013783 (1967)","journal-title":"Communications of the ACM"},{"key":"28_CR12","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.E.: 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.\u00a03142, pp. 846\u2013857. Springer, Heidelberg (2004)"},{"key":"28_CR13","unstructured":"K\u00f6hler, E., Liebchen, C., Rizzi, R., W\u00fcnsch, G.: Reducing the optimality gap of strictly fundamental cycle bases in planar grids. Preprint 007\/2006, TU\u00a0Berlin, Mathematical Institute (2006)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-27679-3_24","volume-title":"Operations Research Proceedings 2004","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., W\u00fcnsch, G.: Minimizing total delay in fixed-time controlled traffic networks. In: Fleuren, H., den Hertog, D., Kort, P. (eds.) Operations Research Proceedings 2004, pp. 192\u2013199. Springer, Heidelberg (2005)"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.2298\/YJOR0501015L","volume":"15","author":"L. Liberti","year":"2005","unstructured":"Liberti, L., Amaldi, E., Maculan, F.M.N.: Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases. Yug. J. of Oper. Res.\u00a015(1), 15\u201324 (2005)","journal-title":"Yug. J. of Oper. Res."},{"key":"28_CR16","unstructured":"Liebchen, C.: Periodic Timetable Optimization in Public Transport. dissertation.de\u00a0\u2013\u00a0Verlag im Internet (2006)"},{"key":"28_CR17","unstructured":"Liebchen, C., W\u00fcnsch, G.: The Zoo of tree spanner problems. Technical Report 2006-013, TU\u00a0Berlin, Mathematical Institute (2006)"},{"key":"28_CR18","unstructured":"Liebchen, C., W\u00fcnsch, G.: Manuscript (2007)"},{"key":"28_CR19","unstructured":"Liebchen, C., W\u00fcnsch, G., K\u00f6hler, E., Reich, A., Rizzi, R.: Benchmarks for strictly fundamental cycle bases. Preprint 003\/2007, TU\u00a0Berlin, Mathematical Institute (2007)"},{"issue":"9","key":"28_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/363219.363232","volume":"12","author":"K. Paton","year":"1969","unstructured":"Paton, K.: An algorithm for finding a fundamental set of cycles of a graph. Communications of the ACM\u00a012(9), 514\u2013518 (1969)","journal-title":"Communications of the ACM"},{"issue":"1","key":"28_CR21","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B.\u00a041(1), 92\u2013114 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms and Combinatorics","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. In: Parallel Processing. LNCS, vol.\u00a024, Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72845-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:05:49Z","timestamp":1605744349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72845-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728443"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72845-0_28","relation":{},"subject":[]}}