{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T01:36:33Z","timestamp":1791077793136,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642174575","type":"print"},{"value":"9783642174582","type":"electronic"}],"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-17458-2_14","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T11:12:57Z","timestamp":1292411577000},"page":"157-169","source":"Crossref","is-referenced-by-count":4,"title":["Finding Strong Bridges and Strong Articulation Points in Linear Time"],"prefix":"10.1007","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luigi","family":"Laura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Federico","family":"Santaroni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput.\u00a01(2), 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11493853_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Flener, P., Lorca, X.: The tree constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 64\u201378. Springer, Heidelberg (2005)"},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1137\/070693217","volume":"38","author":"A.L. 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\u00a038(4), 1533\u20131573 (2008)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1145\/295656.295663","volume":"20","author":"A.L. Buchsbaum","year":"1998","unstructured":"Buchsbaum, A.L., Kaplan, H., Rogers, A., Westbrook, J.R.: A new, simpler linear-time dominators algorithm. ACM Trans. Program. Lang. Syst.\u00a020(6), 1265\u20131296 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"14_CR6","unstructured":"Edmonds, J.: Edge-disjoint branchings. In: Proceedings of the 9th Courant Computer Science Symposium, Combinatorial Algorithms, pp. 91\u201396. Algorithmics Press (1972)"},{"key":"14_CR7","first-page":"129","volume-title":"Proceedings of 12th FOCS","author":"M.J. Fischer","year":"1971","unstructured":"Fischer, M.J., Meyer, A.R.: Boolean matrix multiplication and transitive closure. In: Proceedings of 12th FOCS, pp. 129\u2013131. IEEE, Los Alamitos (1971)"},{"issue":"5","key":"14_CR8","first-page":"1252","volume":"11","author":"M.E. Furman","year":"1970","unstructured":"Furman, M.E.: Applications of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph. Soviet Math. Dokl.\u00a011(5), 1252 (1970)","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"H.N. Gabow","year":"1995","unstructured":"Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci.\u00a050(2), 259\u2013273 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences\u00a030(2), 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Georgiadis, L.: Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs. In: ICALP 2010: Proceedings of the 37th International Colloquium on Automata, Languages and Programming, pp. 433\u2013442 (2010)","DOI":"10.1007\/978-3-642-14165-2_62"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0020-0190(71)90006-8","volume":"1","author":"I. Munro","year":"1971","unstructured":"Munro, I.: Efficient determination of the transitive closure of a directed graph. Inform. Process. Lett.\u00a01(2), 56\u201358 (1971)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00268499","volume":"6","author":"R.E. Tarjan","year":"1976","unstructured":"Tarjan, R.E.: Edge-disjoint spanning trees and depth-first search. Acta Inf.\u00a06, 171\u2013185 (1976)","journal-title":"Acta Inf."},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ipl.2007.04.004","volume":"103","author":"L. Volkmann","year":"2007","unstructured":"Volkmann, L.: Restricted arc-connectivity of digraphs. Inf. Process. Lett.\u00a0103(6), 234\u2013239 (2007)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T19:40:17Z","timestamp":1553283617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}