{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:06Z","timestamp":1725456726760},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540508403"},{"type":"electronic","value":"9783540460985"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":[[1989]]},"DOI":"10.1007\/bfb0028985","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:28:19Z","timestamp":1133396899000},"page":"205-217","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Successive approximation in parallel graph algorithms"],"prefix":"10.1007","author":[{"given":"Donald","family":"Fussell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramakrishna","family":"Thurimella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"17_CR1","first-page":"149","volume":"319","author":"D. Fussell","year":"1988","unstructured":"D. Fussell and R. Thurimella, \u201cSeparation Pair Detection,\u201d VLSI Algorithms and Architectures, LNCS 319 (1988) pp. 149\u2013159.","journal-title":"LNCS"},{"key":"17_CR2","unstructured":"D. S. Hirschberg and D. Volper, \u201cA Parallel Solution for the Minimum Spanning Tree Problem,\u201d Proc. 1983 Johns Hopkins Conf. on Information science and systems (1983) pp. 680\u2013684."},{"key":"17_CR3","unstructured":"M. A. Huang, \u201cSolving Some Graph Problems with Optimal or Near Optimal Speedup on Mesh-of-trees Networks,\u201d Proc. 26th Annual IEEE Symp. on Foundations of Comp. Sci. (1985) pp. 232\u2013240."},{"key":"17_CR4","unstructured":"A. Kanevsky and V. Ramachandran, \u201cImproved Algorithms for Four-connectivity,\u201d Proc. 28th Annual IEEE Symp. on Foundations of Comp. Sci. (1987) pp. 252\u2013259."},{"key":"17_CR5","unstructured":"P.N. Klein and J.H. Reif, \u201cAn Efficient Parallel Algorithm for Planarity,\u201d Proc. 27th Annual IEEE Symp. on foundations of Comp. Sci. (1986) pp. 465\u2013477."},{"key":"17_CR6","unstructured":"T. Leighton, Complexity Issues in VLSI, Cambridge, Massachusetts, MIT Press, 1983, ch.6.1."},{"key":"17_CR7","unstructured":"T. Leighton, \u201cParallel Computation using Meshes of trees,\u201d Proc. 1983 Int. Workshop on Graph-Theoretic Concepts in Computer Science (1983)."},{"key":"17_CR8","unstructured":"L. Lovasz, \u201cComputing Ears and Branching in Parallel,\u201d 26th annual IEEE Symp. on Foundations of Comp. Sci. (1985) pp. 464\u2013467."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber and U. Vishkin, \u201cParallel Ear Decomposition Search (EDS) and ST-numbering in Graphs,\u201d Theoretical Computer Science, 47 (1986) pp. 277\u2013298.","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","volume-title":"Efficient Ear Decomposition with Applications","author":"G.L. Miller","year":"1986","unstructured":"G.L. Miller and V. Ramachandran, \u201cEfficient Ear Decomposition with Applications,\u201d Manuscript, MSRI, Berkeley, CA, Jan. 1986."},{"key":"17_CR11","unstructured":"G.L. Miller and V. Ramachandran, \u201cA New Triconnectivity Algorithm and Its Parallelization,\u201d Proc. 19th Annual Symp. on Theory of Computing (1987) pp. 335\u2013344."},{"key":"17_CR12","first-page":"57","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, \u201cAn O(log n) Parallel Connectivity Algorithm,\u201d J. Algorithms 2 (1981) pp. 57\u201363.","journal-title":"J. Algorithms"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1984","unstructured":"R. E. Tarjan and U. Vishkin, \u201cAn Efficient Parallel Biconnectivity Algorithm,\u201d SIAM J. Computing 14 (1984) pp. 862\u2013874.","journal-title":"SIAM J. Computing"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, \u201cNon-separable and planar graphs,\u201d Trans. Amer. Math. Soc. 34 (1932) pp. 339\u2013362.","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","STACS 89"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:33:27Z","timestamp":1578526407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028985"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540508403","9783540460985"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0028985","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"16 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}