{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:37:59Z","timestamp":1743039479583,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029264"},{"type":"electronic","value":"9783642029271"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02927-1_63","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T04:37:10Z","timestamp":1246682230000},"page":"764-773","source":"Crossref","is-referenced-by-count":0,"title":["Computing the Girth of a Planar Graph in O(n logn) Time"],"prefix":"10.1007","author":[{"given":"Oren","family":"Weimann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"63_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-coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"63_CR2","first-page":"354","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica\u00a017, 354\u2013364 (1997)","journal-title":"Algorithmica"},{"issue":"1-2","key":"63_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial  k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"63_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 Mathematics\u00a024, 311\u2013314 (1978)","journal-title":"Discrete Mathematics"},{"key":"63_CR5","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)"},{"key":"63_CR6","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"},{"key":"63_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)"},{"key":"63_CR8","volume-title":"Graph theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph theory, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"63_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/3-540-45022-X_69","volume-title":"Automata, Languages and Programming","author":"H.N. Djidjev","year":"2000","unstructured":"Djidjev, H.N.: Computing the girth of a planar graph. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 821\u2013831. Springer, Heidelberg (2000)"},{"issue":"4","key":"63_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s004530010043","volume":"28","author":"H. Djidjev","year":"2000","unstructured":"Djidjev, H., Pantziou, G.E., Zaroliagis, C.D.: Improved algorithms for dynamic shortest paths. Algorithmica\u00a028(4), 367\u2013389 (2000)","journal-title":"Algorithmica"},{"issue":"3","key":"63_CR11","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"},{"issue":"3","key":"63_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica\u00a027(3), 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"63_CR13","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"},{"issue":"1","key":"63_CR14","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"G.N. Frederickson","year":"1991","unstructured":"Frederickson, G.N.: Planar graph decomposition and all pairs shortest paths. Journal of the ACM\u00a038(1), 162\u2013204 (1991)","journal-title":"Journal of the ACM"},{"key":"63_CR15","doi-asserted-by":"crossref","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separator theorem for graphs of bounded genus. Journal of Algorithms\u00a05(3) (1984)","DOI":"10.1016\/0196-6774(84)90019-1"},{"issue":"1","key":"63_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. Journal Comp. Sys. Sci.\u00a055(1), 3\u201323 (1997)","journal-title":"Journal Comp. Sys. Sci."},{"issue":"4","key":"63_CR17","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 J. Comput.\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"key":"63_CR18","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 J. Appl. Math.\u00a036, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"63_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01894680","volume":"19","author":"L. Lovasz","year":"1968","unstructured":"Lovasz, L.: On chromatic number of finite set systems. Acta Math. Acad. Sci. Hun.\u00a019, 59\u201367 (1968)","journal-title":"Acta Math. Acad. Sci. Hun."},{"key":"63_CR20","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, 355\u2013369 (1983)","journal-title":"Computing"},{"key":"63_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The clique problem for planar graphs. Information Processing Letters\u00a013, 131\u2013133 (1981)","journal-title":"Information Processing Letters"},{"issue":"1","key":"63_CR22","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. J. Comb. Theory, Ser. B\u00a036(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"63_CR23","doi-asserted-by":"publisher","first-page":"929","DOI":"10.2307\/121059","volume":"150","author":"N. Robertson","year":"1999","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Permanents, pfaffian orientations, and even directed circuits. Ann. of Math.\u00a0150(3), 929\u2013975 (1999)","journal-title":"Ann. of Math."},{"key":"63_CR24","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":"63_CR25","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 J. Discrete Math.\u00a010(2), 209\u2013222 (1997)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:59:30Z","timestamp":1552078770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}