{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T16:43:59Z","timestamp":1773765839421,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1016\/0020-0190(95)00125-v","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"83-87","source":"Crossref","is-referenced-by-count":7,"title":["An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs"],"prefix":"10.1016","volume":"56","author":[{"given":"Wang","family":"Yue-Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Hon-Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee","family":"Chen-Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00125-V_BIB1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02288325","article-title":"Algorithms for finding optimum trees: Description, use, and evaluation","volume":"13","author":"Camerini","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0020-0190(95)00125-V_BIB2","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321707.321710","article-title":"Permutation graphs and transitive graphs","volume":"19","author":"Even","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(95)00125-V_BIB3","series-title":"Proc. 25th Ann. IEEE Symp. on FOCS","first-page":"338","article-title":"Fibonacci heaps and their uses in network optimization algorithms","author":"Fredman","year":"1984"},{"key":"10.1016\/0020-0190(95)00125-V_BIB4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(95)00125-V_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(95)00125-V_BIB6","first-page":"65","article-title":"Graph Theory","author":"Gould","year":"1988"},{"key":"10.1016\/0020-0190(95)00125-V_BIB7","first-page":"44","article-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/0020-0190(95)00125-V_BIB8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(90)90015-P","article-title":"A parallel algorithm for eliminating cycles in undirected graphs","volume":"34","author":"Klein","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00125-V_BIB9","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0020-0190(95)00125-V_BIB10","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(95)00125-V_BIB11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Canad. J. Math."},{"key":"10.1016\/0020-0190(95)00125-V_BIB12","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/0020-0190(95)00125-V_BIB13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(93)90019-6","article-title":"An O(log m) parallel algorithm for the minimum spanning tree problem","volume":"45","author":"Suraweera","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00125-V_BIB14","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0020-0190(95)00125-V_BIB15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","article-title":"An O(\u00a6E\u00a6log log \u00a6V\u00a6) algorithm for finding minimum spanning trees","volume":"4","author":"Yao","year":"1975","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500125V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500125V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:44Z","timestamp":1555297124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500125V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["002001909500125V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00125-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}