{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:03:05Z","timestamp":1769310185523,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T00:00:00Z","timestamp":1442880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00453-015-0075-x","type":"journal-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T18:55:51Z","timestamp":1442948151000},"page":"309-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Certifying 3-Edge-Connectivity"],"prefix":"10.1007","volume":"77","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","published-online":{"date-parts":[[2015,9,22]]},"reference":[{"issue":"3","key":"75_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10817-013-9289-2","volume":"52","author":"E Alkassar","year":"2014","unstructured":"Alkassar, E., B\u00f6hme, S., Mehlhorn, K., Rizkallah, Ch.: A framework for the verification of certifying computations. J. Autom. Reason. 52(3), 241\u2013273 (2014)","journal-title":"J. Autom. Reason."},{"key":"75_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"issue":"11","key":"75_CR3","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1142\/S0129183106009989","volume":"17","author":"JN Corcoran","year":"2006","unstructured":"Corcoran, J.N., Schneider, U., Sch\u00fcttler, H.-B.: Perfect stochastic summation in high order feynman graph expansions. Int. J. Mod. Phys. C 17(11), 1527\u20131549 (2006)","journal-title":"Int. J. Mod. Phys. C"},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"Dehne, F., Langston, M., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: implementations and experiments. In: Parameterized and Exact Computation, pp. 13\u201324 (2006)","DOI":"10.1007\/11847250_2"},{"key":"75_CR5","unstructured":"Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of a family of minimal weighted cuts in graphs. In: Studies in Discrete Mathematics (in Russian), pp. 290\u2013306 (1976)"},{"key":"75_CR6","unstructured":"Fleiner, T., Frank, A.: A quick proof for the cactus representation of mincuts. Technical Report QP-2009-03, Egerv\u00e1ry Research Group, Budapest (2009)"},{"issue":"3\u20134","key":"75_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0190(00)00051-X","volume":"74","author":"HN Gabow","year":"2000","unstructured":"Gabow, H.N.: Path-based depth-first search for strong and biconnected components. Inf. Process. Lett. 74(3\u20134), 107\u2013114 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"75_CR8","doi-asserted-by":"crossref","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 22(1), 57\u201361 (1991)","journal-title":"SIGACT News"},{"key":"75_CR9","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Proceedings of the 8th International Symposium on Graph Drawing (GD\u201900), pp. 77\u201390 (2001)","DOI":"10.1007\/3-540-44541-2_8"},{"issue":"4","key":"75_CR10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"issue":"3","key":"75_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"75_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"DR Karger","year":"2000","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. J. ACM 47(1), 46\u201376 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"75_CR13","doi-asserted-by":"crossref","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 8(1), 91\u2013102 (1988)","journal-title":"Combinatorica"},{"key":"75_CR14","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\u201985) (1985)","DOI":"10.1109\/SFCS.1985.16"},{"key":"75_CR15","doi-asserted-by":"crossref","unstructured":"Mader, W.: A reduction method for edge-connectivity in graphs. In: Bollob\u00e1s, B. (ed.) Advances in Graph Theory, vol.\u00a03 of Annals of Discrete Mathematics, pp. 145\u2013164 (1978)","DOI":"10.1016\/S0167-5060(08)70504-1"},{"issue":"2","key":"75_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119\u2013161 (2011)","journal-title":"Comput. Sci. Rev."},{"key":"75_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264563","volume":"5","author":"K Mehlhorn","year":"1975","unstructured":"Mehlhorn, K.: Nearly optimal binary search trees. Acta Inform. 5, 287\u2013295 (1975)","journal-title":"Acta Inform."},{"key":"75_CR18","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S., Uhrig, C.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"75_CR19","doi-asserted-by":"crossref","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. Jpn. J. Ind. Appl. Math. 9, 163\u2013180 (1992)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"75_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721649","volume-title":"Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications)","author":"H Nagamochi","year":"2008","unstructured":"Nagamochi, H., Ibaraki, T.: Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications). Cambridge University Press, Cambridge (2008)"},{"key":"75_CR21","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)"},{"key":"75_CR22","doi-asserted-by":"crossref","unstructured":"Noschinski, L., Rizkallah, C., Mehlhorn, K.: Verification of certifying computations through Autocorres and Simpl. In: NASA Formal Methods, vol. 8430 of LNCS, pp. 46\u201361 (2014)","DOI":"10.1007\/978-3-319-06200-6_4"},{"issue":"10","key":"75_CR23","doi-asserted-by":"crossref","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-with applications. IEEE Trans. Parallel Distrib. Syst. 7(10), 1009\u20131025 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"75_CR24","unstructured":"Ramachandran, V.: Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. In: Synthesis of Parallel Algorithms, pp. 275\u2013340 (1993)"},{"key":"75_CR25","unstructured":"Schmidt, J.M.: Contractions, removals and certifying 3-connectivity in linear time. Tech. Report B 10-04, Freie Universit\u00e4t Berlin, Germany (2010)"},{"issue":"2","key":"75_CR26","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1137\/110848311","volume":"42","author":"JM Schmidt","year":"2013","unstructured":"Schmidt, J.M.: Contractions, removals and certifying 3-connectivity in linear time. SIAM J. Comput. 42(2), 494\u2013535 (2013)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"75_CR27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ipl.2013.01.016","volume":"113","author":"JM Schmidt","year":"2013","unstructured":"Schmidt, J.M.: A simple test on 2-vertex- and 2-edge-connectivity. Inf. Process. Lett. 113(7), 241\u2013244 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"75_CR28","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. Fundam. E75(3), 410\u2013424 (1992)","journal-title":"IEICE Trans. Fundam."},{"issue":"2","key":"75_CR29","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00224-005-1269-4","volume":"40","author":"YH Tsin","year":"2007","unstructured":"Tsin, Y.H.: A simple 3-edge-connected component algorithm. Theory Comput. Syst. 40(2), 125\u2013142 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"75_CR30","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.jda.2008.04.003","volume":"7","author":"YH Tsin","year":"2009","unstructured":"Tsin, Y.H.: Yet another optimal algorithm for 3-edge-connectivity. J. Discrete Algorithms 7(1), 130\u2013146 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"75_CR31","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/03081088308817513","volume":"13","author":"K-P Vo","year":"1983","unstructured":"Vo, K.-P.: Finding triconnected components of graphs. Linear Multilinear Algebra 13, 143\u2013165 (1983)","journal-title":"Linear Multilinear Algebra"},{"key":"75_CR32","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1080\/03081088308817512","volume":"13","author":"K-P Vo","year":"1983","unstructured":"Vo, K.-P.: Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs. Linear Multilinear Algebra 13, 119\u2013141 (1983)","journal-title":"Linear Multilinear Algebra"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0075-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0075-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0075-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0075-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:22Z","timestamp":1559087242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0075-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,22]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["75"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0075-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,22]]}}}