{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:57:02Z","timestamp":1648897022368},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":[[1994,12]]},"DOI":"10.1016\/0020-0190(94)00147-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"265-271","source":"Crossref","is-referenced-by-count":0,"title":["A parallel algorithm for finding a triconnected component separator with an application"],"prefix":"10.1016","volume":"52","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00147-2_BIB1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(85)90222-1","article-title":"An approach to the subgraph homeomorphism problem","volume":"38","author":"Asano","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(94)00147-2_BIB2","unstructured":"Z.-Z. Chen and X. He, Parallel algorithms for maximal cycle-free sets, Submitted for publication."},{"key":"10.1016\/0020-0190(94)00147-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90019-X","article-title":"Approximate parallel scheduling, II: Applications to optimal parallel graph algorithms in logarithmic time","volume":"91","author":"Cole","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)00147-2_BIB4","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1137\/0222040","article-title":"Finding triconnected components by local replacement","volume":"22","author":"Fussell","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00147-2_BIB5","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","article-title":"A fast parallel algorithm for the maximal independent set problem","volume":"32","author":"Karp","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00147-2_BIB6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0890-5401(90)90031-C","article-title":"Extending planar graph algorithms to K3,3-free graphs","volume":"84","author":"Khuller","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)00147-2_BIB7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/jagm.1993.1008","article-title":"Efficient sequential and parallel algorithms for maximal bipartite sets","volume":"14","author":"Pearson","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)00147-2_BIB8","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00147-2_BIB9","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/0890-5401(89)90017-5","article-title":"NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems","volume":"80","author":"Vazirani","year":"1989","journal-title":"Inform. and Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001472?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001472?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:52:30Z","timestamp":1555145550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0020019094001472"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00147-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}