{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:46:59Z","timestamp":1725756419478},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_31","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"358-369","source":"Crossref","is-referenced-by-count":1,"title":["Certifying 3-Edge-Connectivity"],"prefix":"10.1007","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens M.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-22110-1_7","volume-title":"Computer Aided Verification","author":"E. Alkassar","year":"2011","unstructured":"Alkassar, E., B\u00f6hme, S., Mehlhorn, K., Rizkallah, C.: Verification of certifying computations. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 67\u201382. Springer, Heidelberg (2011)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"11","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1142\/S0129183106009989","volume":"17","author":"J.N. Corcoran","year":"2006","unstructured":"Corcoran, J.N., Schneider, U., Sch\u00fcttler, H.-B.: Perfect stochastic summation in high order feynman graph expansions. International Journal of Modern Physics C\u00a017(11), 1527\u20131549 (2006)","journal-title":"International Journal of Modern Physics C"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11847250_2","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: Implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 13\u201324. Springer, Heidelberg (2006)"},{"issue":"3-4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(00)00051-X","volume":"74","author":"H.N. Gabow","year":"2000","unstructured":"Gabow, H.N.: Path-based depth-first search for strong and biconnected components. Inf. Process. Lett.\u00a074(3-4), 107\u2013114 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/122413.122416","volume":"22","author":"Z. Galil","year":"1991","unstructured":"Galil, Z., Italiano, G.F.: Reducing edge connectivity to vertex connectivity. SIGACT News\u00a022(1), 57\u201361 (1991)","journal-title":"SIGACT News"},{"issue":"4","key":"31_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. Journal of the ACM (JACM)\u00a021(4), 549\u2013568 (1974)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"31_CR8","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. J. ACM\u00a047(1), 46\u201376 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02122557","volume":"8","author":"N. Linial","year":"1988","unstructured":"Linial, N., Lov\u00e1sz, L., Wigderson, A.: Rubber bands, convex embeddings and graph connectivity. Combinatorica\u00a08(1), 91\u2013102 (1988)","journal-title":"Combinatorica"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Computing ears and branchings in parallel. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, FOCS 1985 (1985)","DOI":"10.1109\/SFCS.1985.16"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Mader, W.: A reduction method for edge-connectivity in graphs. In: Bollob\u00e1s, B. (ed.) Advances in Graph Theory. Annals of Discrete Mathematics, vol.\u00a03, pp. 145\u2013164 (1978)","DOI":"10.1016\/S0167-5060(08)70504-1"},{"issue":"2","key":"31_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"R.M. McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Computer Science Review\u00a05(2), 119\u2013161 (2011)","journal-title":"Computer Science Review"},{"key":"31_CR13","unstructured":"Mehlhorn, K., N\u00e4her, S., Uhrig, C.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press (1999)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Neumann, A., Schmidt, J.M.: Certifying 3-edge-connectivity. CoRR, abs\/1211.6553 (2012)","DOI":"10.1007\/978-3-642-45043-3_31"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF03167564","volume":"9","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear time algorithm for computing 3-edge-connected components in a multigraph. Japan Journal of Industrial and Applied Mathematics\u00a09, 163\u2013180 (1992)","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"key":"31_CR16","unstructured":"Neumann, A.: Implementation of Schmidt\u2019s algorithm for certifying triconnectivity testing. Master\u2019s thesis, Universit\u00e4t des Saarlandes and Graduate School of CS, Germany (2011)"},{"issue":"10","key":"31_CR17","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/71.539733","volume":"7","author":"S. Olariu","year":"1996","unstructured":"Olariu, S., Zomaya, A.Y.: A time- and cost-optimal algorithm for interlocking sets \u2013 With applications. IEEE Trans. Parallel Distrib. Syst.\u00a07(10), 1009\u20131025 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"31_CR18","unstructured":"Ramachandran, V.: Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. In: Synthesis of Parallel Algorithms, pp. 275\u2013340 (1993)"},{"key":"31_CR19","unstructured":"Schmidt, J.M.: Contractions, removals and certifying 3-connectivity in linear time. Tech. Report B 10-04, Freie Universit\u00e4t Berlin, Germany (May 2010)"},{"issue":"2","key":"31_CR20","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/110848311","volume":"42","author":"J.M. Schmidt","year":"2013","unstructured":"Schmidt, J.M.: Contractions, removals and certifying 3-connectivity in linear time. SIAM Journal on Computing\u00a042(2), 494\u2013535 (2013)","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"31_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ipl.2013.01.016","volume":"113","author":"J.M. Schmidt","year":"2013","unstructured":"Schmidt, J.M.: A simple test on 2-vertex- and 2-edge-connectivity. Information Processing Letters\u00a0113(7), 241\u2013244 (2013)","journal-title":"Information Processing Letters"},{"issue":"3","key":"31_CR22","first-page":"410","volume":"E75","author":"S. Taoka","year":"1992","unstructured":"Taoka, S., Watanabe, T., Onaga, K.: A linear time algorithm for computing all 3-edge-connected components of a multigraph. IEICE Trans. Fundamentals\u00a0E75(3), 410\u2013424 (1992)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"2","key":"31_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00224-005-1269-4","volume":"40","author":"Y.H. Tsin","year":"2007","unstructured":"Tsin, Y.H.: A simple 3-edge-connected component algorithm. Theor. Comp. Sys.\u00a040(2), 125\u2013142 (2007)","journal-title":"Theor. Comp. Sys."},{"issue":"1","key":"31_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jda.2008.04.003","volume":"7","author":"Y.H. Tsin","year":"2009","unstructured":"Tsin, Y.H.: Yet another optimal algorithm for 3-edge-connectivity. J. of Discrete Algorithms\u00a07(1), 130\u2013146 (2009)","journal-title":"J. of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:09:10Z","timestamp":1558678150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}