{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T11:37:10Z","timestamp":1769081830547,"version":"3.49.0"},"publisher-location":"New York, NY","reference-count":15,"publisher":"Springer New York","isbn-type":[{"value":"9780387968186","type":"print"},{"value":"9780387347707","type":"electronic"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0040371","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"33-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Efficient parallel triconnectivity in logarithmic time"],"prefix":"10.1007","author":[{"given":"Vijaya","family":"Ramachandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","unstructured":"N. Alon, B. Schieber, \"Optimal preprocessing for answering on-line product queries,\" tech. report, Tel Aviv University, May 1987."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","volume":"29","author":"M. J. Attalah","year":"1984","unstructured":"M. J. Attalah, U. Vishkin, \"Finding Euler tours in parallel\", Jour. Comput. and System Sciences, vol. 29, pp. 330\u2013337, 1984.","journal-title":"Jour. Comput. and System Sciences"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"R. Cole, U. Vishkin, \"Approximate and exact parallel scheduling with applications to list, tree and graph problems,\" Proc. 27th Ann. Symp. on Foundations of Comp. Sci., Toronto, Canada, Oct. 1986.","DOI":"10.1109\/SFCS.1986.10"},{"key":"4_CR4","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/B978-0-12-417750-5.50011-7","volume-title":"Theory of Machines and Computations","author":"S. Even","year":"1971","unstructured":"S. Even, A. Itai, \"Queues, stacks, and graphs,\" Theory of Machines and Computations, Z. Kohavi and A. Paz, eds., Academic Press, New York, NY, 1971, pp. 71\u201386."},{"key":"4_CR6","unstructured":"C. F. Gauss, \"Werke,\" Teubner, Leipzig, 1900, pp. 272 and 282\u2013286."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"D. S. Hirschberg","year":"1979","unstructured":"D. S. Hirschberg, A. K. Chandra, D. V. Sarwate, \"Computing connected components on parallel computers,\" CACM, vol. 22, 1979, pp. 461\u2013464.","journal-title":"CACM"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1090\/S0002-9904-1976-13986-9","volume":"82","author":"L. Lovasz","year":"1976","unstructured":"L. Lovasz, M. L. Marx, \"A forbidden substructure characterization of Gauss codes,\" Bull. Amer. Math. Soc., vol. 82, 1976, pp. 121\u2013122.","journal-title":"Bull. Amer. Math. Soc."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber, U. Vishkin, \"Parallel ear decomposition search (EDS) and st-numbering in graphs,\" Theoretical Computer Science, vol. 47, 1986, pp. 277\u2013298.","journal-title":"Theoretical Computer Science"},{"key":"4_CR10","volume-title":"Efficient parallel ear decomposition with applications","author":"G. L. Miller","year":"1986","unstructured":"G. L. Miller, V. Ramachandran, \"Efficient parallel ear decomposition with applications,\" unpublished manuscript, MSRI, Berkeley, CA, January 1986."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"G. L. Miller, V. Ramachandran, \"A new graph triconnectivity algorithm and its parallelization,\" Proc. ACM Symp. on Theory of Computing, New York, NY, May 1987.","DOI":"10.1145\/28395.28431"},{"key":"4_CR12","unstructured":"P. Rosenstiehl, \"Solution algebrique du probleme de Gauss sur la permutation des points d'intersection d'une ou plusiers courbes fermees du plan,\" C. R. Acad. Sci. Paris, vol. 283, no. 8, 1976."},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0196-6774(84)90018-X","volume":"5","author":"P. Rosenstiehl","year":"1984","unstructured":"P. Rosenstiehl, R.E. Tarjan, \"Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations,\" J. Algorithms, Vol. 5, no. 3, 1984, pp. 375\u2013390.","journal-title":"J. Algorithms"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach, U. Vishkin, \"An O(logn) parallel connectivity algorithm,\" J. Algorithms, vol. 3, 1982, pp. 57\u201363.","journal-title":"J. Algorithms"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.2307\/1989545","volume":"34","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, \"Non-separable and planar graphs,\" Trans. Amer. Math. Soc., vol. 34, 1932, pp. 339\u2013362.","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T20:53:54Z","timestamp":1578516834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040371"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780387968186","9780387347707"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0040371","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}