{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:01:27Z","timestamp":1648990887784},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1016\/0020-0190(91)90117-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"241-246","source":"Crossref","is-referenced-by-count":3,"title":["A randomized NC algorithm for the maximal tree cover problem"],"prefix":"10.1016","volume":"40","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90117-Z_BIB1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0219025","article-title":"Parallel depth-first search in general directed graphs","volume":"19","author":"Aggarwal","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90117-Z_BIB2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","article-title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","volume":"7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(91)90117-Z_BIB3","first-page":"33","article-title":"A parallel algorithm for the maximal path problem","author":"Anderson","year":"1985","journal-title":"Proc. 17th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90117-Z_BIB4","first-page":"135","article-title":"Parallel algorithms for level-order traversals in general trees","volume":"14","author":"Chen","year":"1989","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0020-0190(91)90117-Z_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(88)90164-0","article-title":"An improved parallel algorithm that computes the BFS numbering of a directed graph","volume":"28","author":"Gazit","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90117-Z_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","article-title":"An improved maximal matching parallel algorithm","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90117-Z_BIB7","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984","journal-title":"Proc. 16th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90117-Z_BIB8","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby","year":"1985","journal-title":"Proc. 17th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90117-Z_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","article-title":"Parallel algorithms for the connected components and minimal spanning tree problems","volume":"14","author":"Nath","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90117-Z_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-53487-3_47","article-title":"A fast parallel algorithm for finding a maximal bipartite set","volume":"472","author":"Pearson","year":"1990","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0020-0190(91)90117-Z_BIB11","series-title":"RIFIS Tech. Rept. 27","article-title":"Bounded degree maximal subgraph problems are in NC","author":"Shoudai","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190117Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190117Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:46Z","timestamp":1555129546000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190117Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["002001909190117Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90117-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}