{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:16Z","timestamp":1725663076880},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_92","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:53:12Z","timestamp":1330195992000},"page":"424-433","source":"Crossref","is-referenced-by-count":5,"title":["A parallel vertex insertion algorithm for minimum spanning trees"],"prefix":"10.1007","author":[{"given":"Peter","family":"Varman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kshitij","family":"Doshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","volume":"4","author":"P. Spira","year":"1975","unstructured":"Spira, P. and Pan, A., \"On Finding and Updating Spanning Trees and Shortest Paths\", SIAM J. Comp., 4 (1975), pp. 375\u2013380.","journal-title":"SIAM J. Comp."},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","volume":"16","author":"F. Chin","year":"1978","unstructured":"Chin, F. and Houck, D., \"Algorithms for Updating Minimum Spanning Trees\", J. Comput. System Sci., 16 (1978), pp. 333\u2013344.","journal-title":"J. Comput. System Sci."},{"key":"44_CR3","unstructured":"Pawagi, S. and Ramakrishnan I. V., \"Parallel Update of Graph Properties in Logarithmic Time\", Proc. 1985 Intl. Conf. on Parallel Processing, (1985), pp. 186\u2013193."},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","volume":"14","author":"Y. Tsin","year":"1984","unstructured":"Tsin, Y. and Chin, F., \"Efficient Parallel Algorithms for a Class of Graph Theoretic Algorithms\", SIAM J. Comp., 14, (1984), pp. 580\u2013599.","journal-title":"SIAM J. Comp."},{"key":"44_CR5","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","volume":"10","author":"C. Savage","year":"1981","unstructured":"Savage, C. and Ja'Ja, J., \"Fast Efficient Parallel Algorithms for some Graph Problems\", SIAM J. Comp., 10, (1981), pp. 682\u2013691.","journal-title":"SIAM J. Comp."},{"key":"44_CR6","unstructured":"Kwan, S. C., and Ruzzo, W. L., \"Adaptive Parallel Algorithms for Finding Minimum Spanning Trees\", Proc. of the 1984 Intl. Conf. on Parallel Processing, (1984), pp. 175\u2013179."},{"key":"44_CR7","unstructured":"Awerbuck, B. and Shiloach, Y., \"New Connectivity and MSF Algorithms for UltraComputer And PRAM,\" Proc. of the 1983 Intl. Conf. on Parallel Processing, (1983), pp. 175\u2013179."},{"key":"44_CR8","unstructured":"Tarjan, R. E. and Vishkin, U., \"Finding Biconnected Components and Computing Tree Functions in Logarithmic Time\", 25th Annual ACM Symp. on Theory of Computing, (1984), pp. 230\u2013239."},{"issue":"2","key":"44_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"3","author":"R. J. Lipton","year":"1979","unstructured":"Lipton, R. J. and Tarjan, R. E., \"A Separator Theorem for Planar Graphs\", SIAM J. Appl. Math., Vol. 3, No. 2, (1979). pp. 177\u2013189.","journal-title":"SIAM J. Appl. Math."},{"key":"44_CR10","volume-title":"An Efficient Parallel Strong Orientation","author":"U. Vishkin","year":"1984","unstructured":"Vishkin, U., \"An Efficient Parallel Strong Orientation\", TR 109, Computer Science Department, New York University, New York, (1984)."},{"key":"44_CR11","series-title":"Technical Report","volume-title":"A Parallel Algorithm for Vertex Update of Minimum Spanning Trees","author":"K. A. Doshi","year":"1986","unstructured":"Doshi, K. A. and Varman, P. J., \"A Parallel Algorithm for Vertex Update of Minimum Spanning Trees,\" Technical Report, Department of Electrical and Computer Engineering, Rice University, Houston, (1986)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:15Z","timestamp":1619557515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}