{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:52Z","timestamp":1725663772744},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:24:37Z","timestamp":1330262677000},"page":"91-108","source":"Crossref","is-referenced-by-count":0,"title":["Parallel pruning decomposition (PDS) and biconnected components of graphs"],"prefix":"10.1007","author":[{"given":"Eliezer","family":"Dekel","sequence":"first","affiliation":[]},{"given":"Jie","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"K. Abrahamson, N. Dadoun, D. Kirkpatrick, and T. Prsytycka, \u201dA simple Parallel Tree Construction Algorithm,\u201d Journal of Algorithms, 10, pp.287\u2013302, 1989.","journal-title":"Journal of Algorithms"},{"key":"9_CR2","unstructured":"K. W. Chong and T. W. Lam, \u201dFinding Connected Components in O(lognloglogn) Time on the EREW PRAM,\u201d SODA, 1993."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, \u201dOptimal Parallel Algorithms for Expression Tree Evaluation and List Ranking,\u201d AWOC pp.91\u2013100, 1988.","DOI":"10.1007\/BFb0040377"},{"key":"9_CR4","unstructured":"E. Dekel and J. Hu, \u201dA Parallel Algorithm for Finding Minimum Cutsets in Reduceble graphs,\u201d Journal of Parallel and Distributed Processing, to appear."},{"key":"9_CR5","unstructured":"S. Ntafos, E. Dekel and S. Peng, \u201dCompression Trees and Their Applications,\u201d Proc. ICPP, pp.132\u2013139, 1987."},{"key":"9_CR6","volume-title":"Ph. D. Dissertation","author":"J. Hu","year":"1992","unstructured":"J. Hu, \u201dParallel Algorithms for Distributed Systems and Software Engineering,\u201d Ph. D. Dissertation, University of Texas at Dallas, 1992."},{"key":"9_CR7","volume-title":"The Art of Computer Programming. Vol. 1. Fundamental Algorithms","author":"D. Knuth","year":"1968","unstructured":"D. Knuth, \u201dThe Art of Computer Programming. Vol. 1. Fundamental Algorithms,\u201d Addison-Wesley, Reading, MA, 1968."},{"key":"9_CR8","volume-title":"Handbook of Theoretical Computer Science","author":"R. M. Karp","year":"1990","unstructured":"R. M. Karp and V. Ramachandran, \u201dA Survey of Parallel Algorithms for Shared-Memory Machines,\u201d Handbook of Theoretical Computer Science, Cambridge, MIT Press, 1990."},{"key":"9_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, \u201dParallel Ear Decomposition Search and st-Numbering in Graphs,\u201d Theo. Com. Sci., Vol.47, pp.277\u2013298, 1986.","journal-title":"Theo. Com. Sci."},{"issue":"No.l","key":"9_CR10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","volume":"14","author":"D. Nath","year":"1982","unstructured":"D. Nath and S.N. Maheshwari, \u201dParallel Algorithms for the Connected Components and Minimal Spanning Tree Problems,\u201d Inf. Proc. Lett., Vol 14, No.l,pp.7\u201311, 1982.","journal-title":"Inf. Proc. Lett."},{"issue":"No.3","key":"9_CR11","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","volume":"13","author":"Y. H. Tsin","year":"1984","unstructured":"Y. H. Tsin and F. Y. Chin, \u201d Efficient Parallel Algorithms for a Class of Graph Theoretic Problems,\u201d SIAM J. Comput. Vol.13, No.3, pp.580\u2013599, 1984.","journal-title":"SIAM J. Comput."},{"issue":"No.4","key":"9_CR12","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan and U. Vishkin, \u201dAn Efficient Parallel Biconnectivity Algorithm,\u201d SIAM J.Comput., Vol.14, No.4, 862\u2013874, 1985.","journal-title":"SIAM J.Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:20Z","timestamp":1619572100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}