乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:44:03Z","timestamp":1710269043114},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0166-218x(92)90200-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"1-24","source":"Crossref","is-referenced-by-count":24,"title":["New clique and independent set algorithms for circle graphs"],"prefix":"10.1016","volume":"36","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[]},{"given":"Susanne E.","family":"Hambrusch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90200-T_BIB1","series-title":"Proceedings 29th Annual IEEE Symposium on Foundations of Computer Science","first-page":"497","article-title":"Notes on searching in multidimensional monotone arrays","author":"Aggarwal","year":"1988"},{"key":"10.1016\/0166-218X(92)90200-T_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(92)90200-T_BIB3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(86)90044-X","article-title":"Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings","volume":"23","author":"Apostolico","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90200-T_BIB4","article-title":"Efficient parallel algorithms for string editing and related problems","volume":"724","author":"Apostolico","year":"1987","journal-title":"Purdue CS Tech. Rept."},{"key":"10.1016\/0166-218X(92)90200-T_BIB5","series-title":"Efficient stable set and clique finding algorithms for overlap graphs","author":"Buckingham","year":"1981"},{"key":"10.1016\/0166-218X(92)90200-T_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"key":"10.1016\/0166-218X(92)90200-T_BIB7","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\/0166-218X(92)90200-T_BIB8","article-title":"Some polynomial algorithms for certain graphs and hypergraphs","volume":"15","author":"Frank","year":"1976","journal-title":"Cong. Numer."},{"key":"10.1016\/0166-218X(92)90200-T_BIB9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","article-title":"On computing the length of longest increasing subsequences","volume":"11","author":"Fredman","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90200-T_BIB10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","article-title":"Algorithms for a maximum clique and a maximum independent set of a circle graph","volume":"3","author":"Gavril","year":"1973","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90200-T_BIB11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on Circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90200-T_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(92)90200-T_BIB13","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90200-T_BIB14","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0214018","article-title":"Maximum weight clique algorithms for circular-arc graphs and circle graphs","volume":"14","author":"Hsu","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90200-T_BIB15","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","article-title":"A fast algorithm for computing longest common subsequences","volume":"20","author":"Hunt","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(92)90200-T_BIB16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01786986","article-title":"A priority queue in which initialization and queue operations take O(log log D) time","volume":"15","author":"Johnson","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0166-218X(92)90200-T_BIB17","author":"Manacher","year":"1985","journal-title":"Efficient algorithms for new problems on interval graphs"},{"issue":"1","key":"10.1016\/0166-218X(92)90200-T_BIB18","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\/0166-218X(92)90200-T_BIB19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/net.3230110305","article-title":"Finding maximum cliques in circle graphs","volume":"11","author":"Rotem","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90200-T_BIB20","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"van Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290200T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290200T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:49Z","timestamp":1555136569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290200T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0166218X9290200T"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90200-t","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}