{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:39:05Z","timestamp":1648888745561},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":6225,"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":[[1996,7]]},"DOI":"10.1016\/0304-3975(96)00014-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"307-314","source":"Crossref","is-referenced-by-count":0,"title":["Constructing the highest degree subgraph for dense graphs is in N b A S"],"prefix":"10.1016","volume":"161","author":[{"given":"Alexander E.","family":"Andreev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea E.F.","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9D.P.","family":"Rolim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00014-X_BIB1","article-title":"A P-complete problem and approximation to it","author":"Anderson","year":"1984"},{"key":"10.1016\/0304-3975(96)00014-X_BIB2","series-title":"Proc. VI Ann. Internat. Sympo. on Algorithms and Computation (ISAAC)","article-title":"The Parallel Complexity of Approximating the High Degree Subgraph Problem","author":"Alexander","year":"1995"},{"key":"10.1016\/0304-3975(96)00014-X_BIB3","series-title":"Proc. 27th ACM-STOC","first-page":"284","article-title":"Polynomial time approximation schemes for dense instances of NP-hard problems","author":"Arora","year":"1995"},{"key":"10.1016\/0304-3975(96)00014-X_BIB4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","article-title":"The complexity of coloring problems on dense graphs","volume":"43","author":"Edwards","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)00014-X_BIB5","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\/0304-3975(96)00014-X_BIB6","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\/0304-3975(96)00014-X_BIB7","series-title":"Limits to Parallel Computation: P-completeness Theory","author":"Greenlaw","year":"1995"},{"key":"10.1016\/0304-3975(96)00014-X_BIB8","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\/0304-3975(96)00014-X_BIB9","series-title":"Proc. 5th Generation Comput. Systems","first-page":"542","article-title":"Parallel approximation algorithms","author":"Mayr","year":"1988"},{"key":"10.1016\/0304-3975(96)00014-X_BIB10","series-title":"MAXCUT has a randomized approximation scheme for dense graphs","author":"de la Vega","year":"1994"},{"key":"10.1016\/0304-3975(96)00014-X_BIB11","series-title":"Lectures on Parallel Computation","article-title":"PRAM models and fundamental parallel algorithmic techniques","author":"Spirakis","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759600014X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759600014X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:53:27Z","timestamp":1555419207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759600014X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["030439759600014X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00014-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}