{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:06Z","timestamp":1725560766972},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14553-7_1","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T03:59:21Z","timestamp":1280116761000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Progress on Certifying Algorithms"],"prefix":"10.1007","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1 - vertices. Journal of Research of the National Bureau of Standards\u00a069B, 125\u2013130 (1965)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal on Mathematics, 449\u2013467 (1965)","DOI":"10.4153\/CJM-1965-045-4"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Elmasry, A., Mehlhorn, K., Schmidt, J.M.: A Linear Time Certifying Triconnectivity Algorithm for Hamiltonian Graphs. Available at the authors home pages (March 2010)","DOI":"10.1007\/s00453-010-9481-2"},{"key":"1_CR4","unstructured":"Elmasry, A., Mehlhorn, K., Schmidt, J.M.: Every DFS-Tree of a 3-Connected Graph Contains a Contractible Edge. Available at the authors home pages (February 2010)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal of Computing\u00a02(3), 135\u2013158 (1973)","journal-title":"SIAM Journal of Computing"},{"key":"1_CR7","unstructured":"Isabelle theorem prover, http:\/\/isabelle.in.tum.de\/"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Kriesell, M.: A survey on contractible edges in graphs of a prescribed vertex connectivity. Graphs and Combinatorics, 1\u201333 (2002)","DOI":"10.1007\/s003730200000"},{"key":"1_CR9","unstructured":"Mehlhorn, K., McConnell, R., N\u00e4her, S., Schweitzer, P.: Certifying Algorithms. Available at the first author\u2019s homepage and submitted for publication"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01191205","volume":"12","author":"G.L. Miller","year":"1992","unstructured":"Miller, G.L., Ramachandran, V.: A new graph triconnectivity algorithm and its parallelization. Combinatorica\u00a012(1), 53\u201376 (1992)","journal-title":"Combinatorica"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica\u00a07, 583\u2013596 (1992)","journal-title":"Algorithmica"},{"key":"1_CR12","unstructured":"Schmidt, J.M.: Construction sequences and certifying 3-connectedness. In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France (2010), http:\/\/page.mi.fu-berlin.de\/jeschmid\/pub"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","volume":"23","author":"W. Tutte","year":"1961","unstructured":"Tutte, W.: A theory of 3-connected graphs. Indag. Math.\u00a023, 441\u2013455 (1961)","journal-title":"Indag. Math."},{"key":"1_CR14","unstructured":"VCC, a mechanical verifier for concurrent C programs, http:\/\/vcc.codeplex.com\/"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T09:11:15Z","timestamp":1635757875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}