{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:13:55Z","timestamp":1778663635890,"version":"3.51.4"},"reference-count":15,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1080\/00207160008804971","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:24:42Z","timestamp":1182817482000},"page":"129-136","source":"Crossref","is-referenced-by-count":1,"title":["Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>\u2217<\/sup>"],"prefix":"10.1080","volume":"75","author":[{"given":"Hon","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"CIT0002","volume-title":"Finding Minimum Spanning Trees on the EREW PRAM","author":"Chong K. W.","year":"1996"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Cole, R. and Vishkin, U. Approximate and exact parallel scheduling with applications to list, tree and graph problems. 27th IEEE Symposium on Foundations of Computer Science. pp.478\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/0217009"},{"key":"CIT0005","unstructured":"Dixon, B. and Tarjan, R.E. Optimal parallel verification of minimum spanning trees in logarithmic time. Canada-France Conference on Parallel and Distributed Computing, Theory and Practice."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90028-G"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(92)90061-B"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90082-K"},{"key":"CIT0009","volume-title":"An Introduction to Parallel Algorithms","author":"Jaja J.","year":"1992"},{"key":"CIT0010","volume-title":"Simple parallel algorithms for the replacement edge problem and related problems on minimum spanning trees,Department of Computer Science","author":"Katajainen J.","year":"1994"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"},{"key":"CIT0012","unstructured":"Suraweera, F. and Maheshwari, P. A parallel algorithm for the most vital edge problem on the CRCW-SIMD computational model. Proc. 17th Annual Computer Science Conf. Christchurch."},{"key":"CIT0013","volume-title":"Optimal algorithms to find the most vital edge of a minimum spanning tree","author":"Suraweera F.","year":"1995"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"CIT0015","volume":"14","author":"Tarjan R.E.","year":"1982","journal-title":"Information Processing Letters"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160008804971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T21:41:11Z","timestamp":1737150071000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160008804971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1080\/00207160008804971"],"URL":"https:\/\/doi.org\/10.1080\/00207160008804971","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}