{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:29Z","timestamp":1725467909309},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040370","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"24-32","source":"Crossref","is-referenced-by-count":7,"title":["Optimal parallel algorithms on planar graphs"],"prefix":"10.1007","author":[{"given":"Torben","family":"Hagerup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1145\/358628.358650","volume":"25","author":"F. Y. Chin","year":"1982","unstructured":"Francis Y. Chin, John Lam, and I-Ngo Chen: \u201cEfficient Parallel Algorithms for Some Graph Problems\u201d. Communications of the ACM 25 (1982), 659\u2013665.","journal-title":"Communications of the ACM"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Richard Cole and Uzi Vishkin: \u201cApproximate and exact parallel scheduling with applications to list, tree and graph problems\u201d. Proceedings, 27th Annual Symposium on Foundations of Computer Science (1986), 478\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"3_CR3","unstructured":"Richard Cole and Uzi Vishkin: \u201cFaster Optimal Parallel Prefix Sums and List Ranking\u201d. To appear in Information and Computation."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Richard Cole and Uzi Vishkin: \u201cApproximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time\u201d. Preprint, 1987.","DOI":"10.1137\/0217009"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Faith E. Fich, Prabhakar L. Ragde and Avi Wigderson: \u201cRelations Between Concurrent-Write Models of Parallel Computation\u201d. Proceedings, 3rd Annual ACM Symposium on Principles of Distributed Computing (1984), 179\u2013189.","DOI":"10.1145\/800222.806745"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Hillel Gazit: \u201cAn Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph\u201d. Proceedings, 27th Annual Symposium on Foundations of Computer Science (1986), 492\u2013501.","DOI":"10.1109\/SFCS.1986.9"},{"key":"3_CR7","unstructured":"Alan Gibbons and Wojciech Rytter: \u201cOptimal Parallel Algorithms for Dynamic Expression Evaluation and Context-Free Recognition\u201d. Preprint, 1987."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","volume":"75","author":"T. Hagerup","year":"1987","unstructured":"Torben Hagerup: \u201cTowards Optimal Parallel Bucket Sorting\u201d. Information and Computation 75 (1987), 39\u201351.","journal-title":"Information and Computation"},{"key":"3_CR9","unstructured":"Torben Hagerup: \u201cA Note on Saving Space in Parallel Computation\u201d. Submitted to Information Processing Letters."},{"key":"3_CR10","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Frank Harary: \u201cGraph Theory\u201d. Addison-Wesley, Reading, Mass., 1969."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"D. S. Hirschberg","year":"1979","unstructured":"D. S. Hirschberg, A. K. Chandra and D. V. Sarwate: \u201cComputing Connected Components on Parallel Computers\u201d. Communications of the ACM 22 (1979), 461\u2013464.","journal-title":"Communications of the ACM"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Gary L. Miller and John H. Reif: \u201cParallel Tree Contraction and Its Application\u201d. Proceedings, 26th Annual Symposium on Foundations of Computer Science (1985), 478\u2013489.","DOI":"10.1109\/SFCS.1985.43"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Yossi Shiloach and Uzi Vishkin: \u201cAn O(log n) Parallel Connectivity Algorithm\u201d. Journal of Algorithms 3 (1982), 57\u201367.","journal-title":"Journal of Algorithms"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"Robert E. Tarjan and Uzi Vishkin: \u201cAn Efficient Parallel Biconnectivity Algorithm\u201d. SIAM Journal on Computation 14 (1985), 862\u2013874.","journal-title":"SIAM Journal on Computation"}],"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\/BFb0040370.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T02:28:48Z","timestamp":1627698528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0040370","relation":{},"subject":[]}}