{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:15:17Z","timestamp":1726071317309},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":[[1986]]},"DOI":"10.1007\/3-540-16766-8_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:54:18Z","timestamp":1330178058000},"page":"34-45","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Parallel ear decomposition search (EDS) and st-numbering in graphs"],"prefix":"10.1007","author":[{"given":"Yael","family":"Maon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","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":"Anderson, R., \"A Parallel Algorithm for the Maximal Path Problem\", Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 33\u201337."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Cole, R. and Vishkin, U., \"Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms\", Proc. 18th ACM Symp. on Theory of Computing (1986), to appear.","DOI":"10.1145\/12130.12151"},{"key":"4_CR3","unstructured":"Even, S., \"Graph Algorithms\", Computer Science Press, 1979."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., and Tarjan, R.E., \"Computing an st-numbering\", Th. Comp. Science 2 (1976), pp. 339\u2013344.","journal-title":"Th. Comp. Science"},{"key":"4_CR5","unstructured":"Itai, A. and Rodeh, M., \"The Multi-Tree Approach to Reliability in Distributed Networks\", Proc. 25th Symp. on Foundations of Comp. Science (1984), pp. 137\u2013147."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/0211024","volume":"11","author":"J. Ja'Ja'","year":"1982","unstructured":"Ja'Ja' J. and Simon, J., \"Parallel Algorithms in Graph Theory: Planarity Testing\", SIAM J. of Computing 11 (1982), pp. 314\u2013328.","journal-title":"SIAM J. of Computing"},{"key":"4_CR7","first-page":"215","volume-title":"An Algorithm for Planarity Testing of Graphs","author":"A. Lempel","year":"1967","unstructured":"Lempel, A., Even, S. and Cederbaum, I., \"An Algorithm for Planarity Testing of Graphs\", Theory of Graphs, Int. Symp., Rome, July 1966. P. Rosenstiehl, Ed., Gordon and Breach, NY (1967), pp. 215\u2013232."},{"key":"4_CR8","unstructured":"Lovasz, L., \"Computing Ears and Branchings in Parallel\", Proc. 26th Symp. on Foundations of Comp. Science (1985), pp. 464\u2013467."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Maon, Y., Schieber, B. and Vishkin, U., \"Parallel Ear Decomposition Search (EDS) and ST-Numbering in Graphs\", TR 46\/86 Dept. of Computer Science, Tel Aviv University, 1986.","DOI":"10.1007\/3-540-16766-8_4"},{"key":"4_CR10","unstructured":"Reif, J.H., \"An Optimal Parallel Algorithm for Integer Sorting\", Proc. 26th Symp. on Foundations of Comp. Science (1985), pp. 496\u2013503."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Shiloach, Y. and Vishkin, U., \"An O (log n) Parallel Connectivity Algorithm\", J. of Algorithms 3 (1982), pp. 57\u201363.","journal-title":"J. of Algorithms"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E. and Vishkin, U., \"An Efficient Parallel Biconnectivity Algorithm\", SIAM J. of Computing 14 (1985), pp. 862\u2013874.","journal-title":"SIAM J. of Computing"},{"key":"4_CR13","unstructured":"Vishkin, U., \"Synchronous Parallel Computation \u2014 a Survey\", TR #71, Dept. of Computer Science, Courant Inst., NYU, 1983."},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","volume":"20","author":"U. Vishkin","year":"1985","unstructured":"Vishkin, U., \"On Efficient Parallel Strong Orientation\", Information Proc. Letters 20 (1985), pp. 235\u2013240.","journal-title":"Information Proc. Letters"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"Whitney, H., \"Non-separable and Planar Graphs\", Trans. Amer. Math. Soc. 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\/3-540-16766-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:52:07Z","timestamp":1578509527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_4"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}