{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T05:47:52Z","timestamp":1746078472816,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_49","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"605-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["2-Vertex Connectivity in Directed Graphs"],"prefix":"10.1007","author":[{"given":"Loukas","family":"Georgiadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Laura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Parotsidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"6","key":"49_CR1","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1137\/S0097539797317263","volume":"28","author":"S Alstrup","year":"1999","unstructured":"Alstrup, S., Harel, D., Lauridsen, P.W., Thorup, M.: Dominators in linear time. SIAM Journal on Computing 28(6), 2117\u201332 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"49_CR2","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1137\/070693217","volume":"38","author":"AL Buchsbaum","year":"2008","unstructured":"Buchsbaum, A.L., Georgiadis, L., Kaplan, H., Rogers, A., Tarjan, R.E., Westbrook, J.R.: Linear-time algorithms for dominators and other path-evaluation problems. SIAM Journal on Computing 38(4), 1533\u20131573 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Georgiadis, L., Italiano, G.F., Laura, L., Parotsidis, N.: 2-edge connectivity in directed graphs. In: Proc. 26th ACM-SIAM Symp. on Discrete Algorithms, pp. 1988\u20132005 (2015)","DOI":"10.1137\/1.9781611973730.132"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Georgiadis, L., Tarjan, R.E.: Dominator tree certification and independent spanning trees (2012). CoRR, abs\/1210.8303","DOI":"10.1007\/978-3-642-31594-7_32"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Krinninger, S., Loitzenbauer, V.: Finding 2-edge and 2-vertex strongly connected components in quadratic time. In: Proc. 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) (2015)","DOI":"10.1007\/978-3-662-47672-7_58"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2011.11.011","volume":"447","author":"GF Italiano","year":"2012","unstructured":"Italiano, G.F., Laura, L., Santaroni, F.: Finding strong bridges and strong articulation points in linear time. Theoretical Computer Science 447, 74\u201384 (2012)","journal-title":"Theoretical Computer Science"},{"key":"49_CR7","unstructured":"Jaberi, R.: Computing the $$2$$-blocks of directed graphs (2014). CoRR, abs\/1407.6178"},{"key":"49_CR8","unstructured":"Jaberi, R.: On computing the $$2$$-vertex-connected components of directed graphs (2014) CoRR, abs\/1401.6000"},{"key":"49_CR9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 96\u2013115 (1927)","journal-title":"Fund. Math."},{"issue":"4","key":"49_CR10","first-page":"513","volume":"E76A","author":"H Nagamochi","year":"1993","unstructured":"Nagamochi, H., Watanabe, T.: Computing $$k$$-edge-connected components of a multigraph. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E76A(4), 513\u2013517 (1993)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Spirakis, P.G.: Strong $$k$$-connectivity in digraphs and random digraphs. Technical Report TR-25-81, Harvard University (1981)","DOI":"10.21236\/ADA109034"},{"issue":"2","key":"49_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"49_CR13","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0203006","volume":"3","author":"RE Tarjan","year":"1974","unstructured":"Tarjan, R.E.: Finding dominators in directed graphs. SIAM Journal on Computing 3(1), 62\u201389 (1974)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:14:15Z","timestamp":1676945655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}