{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:48Z","timestamp":1725600468114},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_20","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:54:39Z","timestamp":1312952079000},"page":"225-236","source":"Crossref","is-referenced-by-count":0,"title":["Computing the Girth of a Planar Graph in Linear Time"],"prefix":"10.1007","author":[{"given":"Hsien-Chih","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsueh-I","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color\u2013coding. JACM\u00a042(4), 844\u2013856 (1995)","journal-title":"JACM"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica\u00a017(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"1-2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(78)90102-4","volume":"24","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Chromatic number, girth and maximal degree. Discrete Math.\u00a024, 311\u2013314 (1978)","journal-title":"Discrete Math."},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502793.1502798","volume":"56","author":"G. Borradaile","year":"2009","unstructured":"Borradaile, G., Klein, P.N.: An O(nlogn) algorithm for maximum st-flow in a directed planar graph. JACM\u00a056(2), 9.1\u20139.30 (2009)","journal-title":"JACM"},{"key":"20_CR6","unstructured":"Boyer, J.M., Myrvold, W.J.: Stop minding your P\u2019s and Q\u2019s: A simplified planar embedding algorithm. In: SODA, pp. 140\u2013146 (1999)"},{"key":"20_CR7","unstructured":"Chalermsook, P., Fakcharoenphol, J., Nanongkai, D.: A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. In: SODA, pp. 828\u2013829 (2004)"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jctb.2004.05.004","volume":"93","author":"L.S. Chandran","year":"2005","unstructured":"Chandran, L.S., Subramanian, C.R.: Girth and treewidth. Journal of Combinatorial Theory, Series B\u00a093(1), 23\u201332 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"20_CR9","unstructured":"Chang, H.-C., Lu, H.-I.: Computing the girth of a planar graph in linear time (2011), \n                  \n                    http:\/\/arxiv.org\/abs\/1104.4892"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02018401","volume":"6","author":"R.J. Cook","year":"1975","unstructured":"Cook, R.J.: Chromatic number and girth. Periodica Mathematica Hungarica\u00a06, 103\u2013107 (1975)","journal-title":"Periodica Mathematica Hungarica"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"20_CR12","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1868237.1868240","volume":"7","author":"H.N. Djidjev","year":"2010","unstructured":"Djidjev, H.N.: A faster algorithm for computing the girth of planar and bounded genus graphs. ACM Transactions on Algorithms\u00a07(1), 3.1\u20133.16 (2010)","journal-title":"ACM Transactions on Algorithms"},{"key":"20_CR14","unstructured":"Dorn, F.: Planar subgraph isomorphism revisited. In: STACS, pp. 263\u2013274 (2010)"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications\u00a03(3), 1\u201327 (1999)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P.: Graph theory and probability. Canadian Journal of Math.\u00a011, 34\u201338 (1959)","journal-title":"Canadian Journal of Math."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Erickson, J.: Maximum flows and parametric shortest paths in planar graphs. In: SODA, pp. 794\u2013804 (2010)","DOI":"10.1137\/1.9781611973075.65"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1006\/jcss.1995.1076","volume":"51","author":"M.T. Goodrich","year":"1995","unstructured":"Goodrich, M.T.: Planar separators and parallel polygon triangulation. Journal of Computer and System Sciences\u00a051(3), 374\u2013389 (1995)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"20_CR19","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J. Hao","year":"1994","unstructured":"Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a directed graph. Journal of Algorithms\u00a017(3), 424\u2013446 (1994)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR21","unstructured":"Italiano, G.F., Nussbaum, Y., Sankowski, P., Wulff-Nilsen, C.: Improved minimum cuts and maximum flows in undirected planar graphs. In: STOC, pp. 313\u2013322 (2011), \n                  \n                    http:\/\/portal.acm.org\/citation.cfm?doid=1993636.1993679"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"D.R. Karger","year":"2000","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. JACM\u00a047(1), 46\u201376 (2000)","journal-title":"JACM"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. JACM\u00a043(4), 601\u2013640 (1996)","journal-title":"JACM"},{"key":"20_CR24","unstructured":"Klein, P.N.: Multiple-source shortest paths in planar graphs. In: SODA, pp. 146\u2013155 (2005)"},{"issue":"10","key":"20_CR25","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.ipl.2009.01.008","volume":"109","author":"A. Lingas","year":"2009","unstructured":"Lingas, A., Lundell, E.-M.: Efficient approximation algorithms for shortest cycles in undirected graphs. Information Processing Letters\u00a0109(10), 493\u2013498 (2009)","journal-title":"Information Processing Letters"},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Math.\u00a036(2), 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Math."},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01894680","volume":"19","author":"L. Lov\u00e1sz","year":"1968","unstructured":"Lov\u00e1sz, L.: On chromatic number of finite set systems. Acta Mathematica Academiae Scientiarum Hungaricae\u00a019, 59\u201367 (1968)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"issue":"4","key":"20_CR28","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF02251238","volume":"31","author":"B. Monien","year":"1983","unstructured":"Monien, B.: The complexity of determining a shortest cycle of even length. Computing\u00a031(4), 355\u2013369 (1983)","journal-title":"Computing"},{"issue":"1","key":"20_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B\u00a036(1), 49\u201364 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"5","key":"20_CR30","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/12.53581","volume":"39","author":"W.-K. Shih","year":"1990","unstructured":"Shih, W.-K., Wu, S., Kuo, Y.-S.: Unifying maximum cut and minimum cut of a planar graph. IEEE Transactions on Computers\u00a039(5), 694\u2013697 (1990)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"20_CR31","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026(3), 362\u2013391 (1983)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/3-540-19488-6_149","volume-title":"Automata, Languages and Programming","author":"V.V. Vazirani","year":"1988","unstructured":"Vazirani, V.V., Yannakakis, M.: Pfaffian orientations, 0\/1 permanents, and even cycles in directed graphs. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 667\u2013681. Springer, Heidelberg (1988)"},{"issue":"2","key":"20_CR33","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1137\/090767868","volume":"24","author":"O. Weimann","year":"2010","unstructured":"Weimann, O., Yuster, R.: Computing the girth of a planar graph in O(n logn) time. SIAM Journal on Discrete Math.\u00a024(2), 609\u2013616 (2010)","journal-title":"SIAM Journal on Discrete Math."},{"issue":"2","key":"20_CR34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1137\/S0895480194274133","volume":"10","author":"R. Yuster","year":"1997","unstructured":"Yuster, R., Zwick, U.: Finding even cycles even faster. SIAM Journal on Discrete Math.\u00a010(2), 209\u2013222 (1997)","journal-title":"SIAM Journal on Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T05:03:55Z","timestamp":1554008635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}