{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:00:46Z","timestamp":1648890046837},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0304-3975(97)00276-4","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T23:26:12Z","timestamp":1049498772000},"page":"261-282","source":"Crossref","is-referenced-by-count":0,"title":["The parallel complexity of approximating the high degree subgraph problem"],"prefix":"10.1016","volume":"205","author":[{"given":"A.E.","family":"Andreev","sequence":"first","affiliation":[]},{"given":"A.","family":"Clementi","sequence":"additional","affiliation":[]},{"given":"P.","family":"Crescenzi","sequence":"additional","affiliation":[]},{"given":"E.","family":"Dahlhaus","sequence":"additional","affiliation":[]},{"given":"S.","family":"De Agostino","sequence":"additional","affiliation":[]},{"given":"J.D.P.","family":"Rolim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00276-4_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB2","article-title":"A P-complete problem and approximation to it","author":"Anderson","year":"1984"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB3","series-title":"Advances in Computing Research: Parallel and Distributed Computing","first-page":"17","article-title":"Parallelism and greedy algorithms","author":"Anderson","year":"1987"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB4","series-title":"Random Graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB5","doi-asserted-by":"crossref","unstructured":"G. Bongiovanni, P. Crescenzi, S. De Agostino, MAX SAT and MIN SET COVER approximation algorithms are P-complete, Parallel Process. Lett. to appear.","DOI":"10.1142\/S0129626495000278"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB6","unstructured":"D.P. Bovet, A. Clementi, P. Crescenzi, R. Silvestri, Parallel approximation algorithms for optimization problems, Tech. Rep. SI\/RR-95\/09, Department of Computer Science, Rome University."},{"key":"10.1016\/S0304-3975(97)00276-4_BIB7","doi-asserted-by":"crossref","unstructured":"A. Clementi, J. Rolim, L. Kucera, A note on parallel randomized algorithms for searching problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences, American Mathematical Society, to appear.","DOI":"10.1090\/dimacs\/022\/02"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BF02759702","article-title":"On the structure of linear graphs","volume":"1","author":"Erd\u00f6s","year":"1963","journal-title":"Israel J. Math."},{"key":"10.1016\/S0304-3975(97)00276-4_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(89)90026-3","article-title":"Ordered vertex removal and subgraph problems","volume":"39","author":"Greenlaw","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00276-4_BIB10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0890-5401(92)90033-C","article-title":"A model classifying algorithms as inherently sequential with applications to graph searching","volume":"97","author":"Greenlaw","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00276-4_BIB11","unstructured":"R. Greenlaw, H.J. Hoover, W.L. Ruzzo, Limits to Parallel Computation: P-completeness Theory, Oxford University Press, Oxford, to appear."},{"key":"10.1016\/S0304-3975(97)00276-4_BIB12","first-page":"869","article-title":"Parallel algorithms for shared memory machines","volume":"vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB13","series-title":"Proc. 19th MFCS","first-page":"462","article-title":"Hammock-on-Ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems","author":"Kavvadias","year":"1994"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB14","series-title":"Proc. 30th IEEE-FOCS","first-page":"446","article-title":"The parallel complexity of the connected subgraph problem","author":"Kirousis","year":"1989"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log-space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB16","first-page":"74","article-title":"Combinatorial Problems and Exercises","author":"Lovasz","year":"1978"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB17","series-title":"Proc. 21st ICALP","first-page":"508","article-title":"Short vertex disjoint paths and multiconnectivity in random graphs: reliable networks computing","author":"Nikoletseas","year":"1994"},{"key":"10.1016\/S0304-3975(97)00276-4_BIB18","series-title":"Graphentheorie","author":"Wagner","year":"1970"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002764?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002764?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:01:57Z","timestamp":1555405317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397597002764"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00276-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}